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 01:20Victor MerckléVictor MerckléScore: 6,962Success
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 01:206,95265,469,44556,703,0001,001,0002,113,536
2May 16, 2026 01:206,95466,225,85057,722,00002,113,536
3May 16, 2026 01:206,95766,077,81756,741,0001,003,0002,113,536
4May 16, 2026 01:206,96165,076,22156,744,0001,034,0002,113,536
5May 16, 2026 01:206,96267,303,93956,744,0001,048,0002,113,536
6May 16, 2026 01:206,96565,661,18156,739,0001,075,0002,113,536
7May 16, 2026 01:206,98368,274,94156,953,0001,013,0002,113,536
8May 16, 2026 01:207,00966,267,37958,180,00002,113,536
9May 16, 2026 01:207,01767,481,48257,238,0001,006,0002,113,536