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 02:16Andrew EpsteinAndrew EpsteinScore: 34,430Success
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 02:2334,246293,449,441282,219,0002,029,0002,121,728stderr
2Nov 3, 2026 02:2334,278293,833,653282,502,0002,008,0002,121,728stderr
3Nov 3, 2026 02:2334,299294,003,915282,678,0002,004,0002,121,728stderr
4Nov 3, 2026 02:2334,393294,912,922283,462,0002,007,0002,121,728stderr
5Nov 3, 2026 02:2334,430295,575,190283,764,0002,006,0002,121,728stderr
6Nov 3, 2026 02:2334,463295,420,380284,027,0002,023,0002,121,728stderr
7Nov 3, 2026 02:2334,485295,515,865284,220,0002,011,0002,121,728stderr
8Nov 3, 2026 02:2334,487295,623,274284,234,0002,010,0002,121,728stderr
9Nov 3, 2026 02:2334,644296,822,084285,544,0002,005,0002,121,728stderr