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 5, 2026 01:09olliecrowolliecrowScore: 7,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 01:107,27878,962,99058,190,0002,222,0002,527,232
2May 5, 2026 01:107,41179,362,52859,232,0002,282,0002,428,928
3May 5, 2026 01:107,42079,843,68759,353,0002,240,0002,494,464
4May 5, 2026 01:107,42980,070,72759,375,0002,288,0002,469,888
5May 5, 2026 01:107,43277,966,52159,644,0002,047,0002,502,656
6May 5, 2026 01:107,46978,878,80959,716,0002,281,0002,404,352
7May 5, 2026 01:107,50078,786,29560,066,0002,184,0002,293,760
8May 5, 2026 01:107,51378,055,90560,216,0002,149,0002,531,328
9May 5, 2026 01:108,22583,765,77365,989,0002,281,0002,502,656