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 21, 2026 12:27Victor MerckléVictor MerckléScore: 4,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:284,65246,996,20537,545,0001,073,0002,113,536
2May 21, 2026 12:284,65846,528,44037,584,0001,080,0002,113,536
3May 21, 2026 12:284,66048,035,69737,570,0001,110,0002,113,536
4May 21, 2026 12:284,66246,589,37837,629,0001,072,0002,113,536
5May 21, 2026 12:284,66446,712,56537,705,0001,007,0002,113,536
6May 21, 2026 12:284,66846,683,60637,657,0001,092,0002,113,536
7May 21, 2026 12:284,67146,680,12037,750,0001,020,0002,113,536
8May 21, 2026 12:284,67246,842,12337,737,0001,042,0002,113,536
9May 21, 2026 12:284,67346,631,17437,761,0001,028,0002,113,536