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 16, 2026 00:18Victor MerckléVictor MerckléScore: 6,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 00:196,95066,519,48457,689,00002,113,536
2May 16, 2026 00:196,95164,976,45756,676,0001,024,0002,113,536
3May 16, 2026 00:196,95265,499,72456,697,0001,011,0002,113,536
4May 16, 2026 00:196,95267,174,18357,702,00002,113,536
5May 16, 2026 00:196,95467,033,74556,709,0001,014,0002,113,536
6May 16, 2026 00:196,95466,677,44256,706,0001,020,0002,113,536
7May 16, 2026 00:197,00766,665,21457,113,0001,048,0002,113,536
8May 16, 2026 00:197,02368,436,76658,295,00002,113,536
9May 16, 2026 00:197,02468,410,65657,296,0001,010,0002,113,536