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 20, 2026 18:35Victor MerckléVictor MerckléScore: 4,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 18:364,76449,944,89938,486,0001,063,0002,113,536
2May 20, 2026 18:364,77747,496,95538,579,0001,076,0002,113,536
3May 20, 2026 18:364,78547,718,65138,682,0001,036,0002,113,536
4May 20, 2026 18:364,79749,595,62338,780,0001,039,0002,113,536
5May 20, 2026 18:364,79950,859,41338,774,0001,060,0002,113,536
6May 20, 2026 18:364,81856,074,50438,986,0001,005,0002,113,536
7May 20, 2026 18:364,82059,295,68138,947,0001,063,0002,113,536
8May 20, 2026 18:364,85274,286,34239,184,0001,094,0002,113,536
9May 20, 2026 18:364,85448,268,22939,233,0001,063,0002,113,536