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 13, 2026 02:04Victor MerckléVictor MerckléScore: 9,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 02:049,32385,210,72277,387,00002,113,536
2May 13, 2026 02:049,32586,960,91577,399,00002,113,536
3May 13, 2026 02:049,32884,729,53976,427,0001,001,0002,113,536
4May 13, 2026 02:049,33087,694,59076,435,0001,006,0002,113,536
5May 13, 2026 02:049,33186,818,63176,422,0001,027,0002,113,536
6May 13, 2026 02:049,33185,507,39576,408,0001,047,0002,113,536
7May 13, 2026 02:049,33385,823,26276,445,0001,025,0002,113,536
8May 13, 2026 02:049,36388,115,90076,685,0001,034,0002,113,536
9May 13, 2026 02:049,48886,410,70877,743,0001,011,0002,113,536