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 listApr 12, 2026 02:58Josu San MartinJosu San MartinScore: 5,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 02:585,08265,877,48739,167,0003,012,0002,265,088
2Apr 12, 2026 03:005,09862,826,14539,292,0003,022,0002,297,856
3Apr 12, 2026 03:005,10966,889,16741,393,0001,009,0002,523,136
4Apr 12, 2026 02:585,11663,318,73040,440,0002,022,0002,281,472
5Apr 12, 2026 03:005,32468,236,88641,176,0003,012,0002,289,664
6Apr 12, 2026 02:585,54972,480,05544,051,0002,002,0002,510,848