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 17, 2026 03:53Kevin HeaveyKevin HeaveyScore: 3,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 04:073,66640,316,43729,380,0001,053,0002,113,536
2Jul 17, 2026 04:073,68540,449,96729,547,0001,046,0002,113,536
3Jul 17, 2026 04:073,68640,473,53829,546,0001,050,0002,113,536
4Jul 17, 2026 04:073,69543,786,00729,624,0001,047,0002,113,536
5Jul 17, 2026 04:073,70340,561,41429,690,0001,052,0002,113,536
6Jul 17, 2026 04:073,76841,093,46430,235,0001,046,0002,113,536
7Jul 17, 2026 04:073,87742,059,57831,137,0001,049,0002,113,536
8Jul 17, 2026 04:073,92142,486,64531,498,0001,047,0002,113,536
9Jul 17, 2026 04:073,93542,549,09531,617,0001,047,0002,113,536