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 listFeb 18, 2026 03:55Josu San MartinJosu San MartinScore: 6,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 03:555,88171,768,79945,822,0002,988,0002,469,888
2Feb 18, 2026 03:555,99871,334,89848,792,000995,0002,465,792
3Feb 18, 2026 03:556,10080,806,71249,619,0001,012,0002,469,888
4Feb 18, 2026 03:556,23875,771,86349,782,0001,991,0002,330,624
5Feb 18, 2026 03:556,32584,779,81351,486,0001,009,0002,330,624
6Feb 18, 2026 03:556,48183,502,64951,802,0001,992,0002,486,272