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 17, 2026 03:03Andrew EpsteinAndrew EpsteinScore: 133,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 03:03132,5031,110,050,5881,098,772,0001,006,0002,117,632stderr
2Sep 17, 2026 03:03132,7381,112,014,7411,100,722,0001,009,0002,117,632stderr
3Sep 17, 2026 03:03132,7661,112,226,0351,100,951,0001,008,0002,117,632stderr
4Sep 17, 2026 03:03132,8591,113,050,2381,101,727,0001,004,0002,117,632stderr
5Sep 17, 2026 03:03133,0941,115,156,7461,102,656,0002,026,0002,117,632stderr
6Sep 17, 2026 03:03133,1981,115,727,8121,104,534,0001,010,0002,117,632stderr
7Sep 17, 2026 03:03133,2131,116,578,6081,104,668,0001,001,0002,117,632stderr
8Sep 17, 2026 03:03133,3291,117,199,3271,105,631,0001,007,0002,117,632stderr
9Sep 17, 2026 03:03133,8821,121,460,2881,110,220,0001,005,0002,117,632stderr