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 listJul 22, 2026 21:58Kevin HeaveyKevin HeaveyScore: 3,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 21:593,77541,257,87529,221,0002,119,0002,113,536
2Jul 22, 2026 21:593,77741,193,84929,241,0002,113,0002,113,536
3Jul 22, 2026 21:593,79341,335,81429,438,0002,051,0002,113,536
4Jul 22, 2026 21:593,92642,491,66330,194,0002,400,0002,113,536
5Jul 22, 2026 21:593,93542,513,86430,418,0002,250,0002,113,536
6Jul 22, 2026 21:593,94142,678,53030,519,0002,195,0002,113,536
7Jul 22, 2026 21:5961,650521,549,681509,565,0002,130,0002,113,536
8Jul 22, 2026 21:5963,075533,377,265521,433,0002,094,0002,113,536
9Jul 22, 2026 21:5963,952540,725,112528,651,0002,155,0002,113,536