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 listNov 3, 2026 07:54Andrew EpsteinAndrew EpsteinScore: 107,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 07:55107,293899,859,992888,534,0002,004,0002,121,728stderr
2Nov 3, 2026 07:55107,371901,056,163888,160,0003,021,0002,121,728stderr
3Nov 3, 2026 07:55107,464901,374,043888,896,0003,062,0002,121,728stderr
4Nov 3, 2026 07:55107,487901,412,666888,895,0003,249,0002,121,728stderr
5Nov 3, 2026 07:55107,726903,476,619892,126,0002,002,0002,121,728stderr
6Nov 3, 2026 07:55107,748904,141,156892,302,0002,007,0002,121,728stderr
7Nov 3, 2026 07:55107,794904,512,687892,683,0002,008,0002,121,728stderr
8Nov 3, 2026 07:55107,796904,455,443892,707,0002,002,0002,121,728stderr
9Nov 3, 2026 07:55108,056906,153,978894,861,0002,004,0002,121,728stderr