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 15, 2026 17:57wnwnScore: 13,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 17:5713,529136,483,042106,277,0006,015,0002,441,216
2Feb 15, 2026 17:5713,606141,901,799104,934,0007,994,0002,437,120
3Feb 15, 2026 17:5713,708139,944,530106,790,0006,986,0002,326,528
4Feb 15, 2026 17:5713,745135,688,958105,078,0009,006,0002,510,848
5Feb 15, 2026 17:5713,818142,296,117107,712,0006,981,0002,473,984
6Feb 15, 2026 17:5713,872142,130,599107,126,0008,009,0002,351,104
7Feb 15, 2026 17:5713,872143,157,659107,131,0008,009,0002,469,888
8Feb 15, 2026 17:5714,041143,567,735107,499,0009,042,0002,342,912
9Feb 15, 2026 17:5714,199147,561,373107,861,0009,987,0002,478,080