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 18:14Victor MerckléVictor MerckléScore: 7,701Success
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 18:147,68873,356,13663,817,00002,113,536
2May 13, 2026 18:147,69773,222,82162,884,0001,006,0002,113,536
3May 13, 2026 18:147,69971,306,62362,863,0001,043,0002,113,536
4May 13, 2026 18:147,69971,289,08362,866,0001,038,0002,113,536
5May 13, 2026 18:147,70173,343,22862,917,0001,005,0002,113,536
6May 13, 2026 18:147,70373,178,99562,936,0001,002,0002,113,536
7May 13, 2026 18:147,70372,798,15762,922,0001,020,0002,113,536
8May 13, 2026 18:147,70571,224,12962,932,0001,020,0002,113,536
9May 13, 2026 18:147,71674,289,72462,995,0001,048,0002,113,536