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 listSep 14, 2026 10:55Kevin HeaveyKevin HeaveyScore: 3,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 10:563,52638,048,02328,084,0001,188,0002,113,536
2Sep 14, 2026 10:563,54641,229,99028,231,0001,208,0002,113,536
3Sep 14, 2026 10:563,55638,028,65128,315,0001,208,0002,113,536
4Sep 14, 2026 10:563,56038,297,70528,376,0001,180,0002,113,536
5Sep 14, 2026 10:563,66639,227,76629,262,0001,174,0002,113,536
6Sep 14, 2026 10:563,79641,031,27730,304,0001,206,0002,113,536
7Sep 14, 2026 10:563,80341,092,94030,369,0001,204,0002,113,536
8Sep 14, 2026 10:563,84041,355,57230,662,0001,214,0002,113,536
9Sep 14, 2026 10:563,88049,708,54230,963,0001,243,0002,113,536