Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 13, 2026 23:44Victor MerckléVictor MerckléScore: 7,665Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 23:447,65572,892,32563,542,00002,113,536
2May 13, 2026 23:447,65972,444,56663,574,00002,113,536
3May 13, 2026 23:447,66072,539,62563,581,00002,113,536
4May 13, 2026 23:447,66571,382,85862,621,0001,004,0002,113,536
5May 13, 2026 23:447,66573,552,55862,620,0001,006,0002,113,536
6May 13, 2026 23:447,66570,894,38262,622,0001,001,0002,113,536
7May 13, 2026 23:447,66673,225,12962,588,0001,048,0002,113,536
8May 13, 2026 23:447,69774,130,23663,888,00002,113,536
9May 13, 2026 23:447,70773,023,90762,955,0001,019,0002,113,536