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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 21:593,71040,809,77529,610,0001,188,0002,113,536
2Jul 25, 2026 21:593,77241,378,48030,269,0001,041,0002,113,536
3Jul 25, 2026 21:593,78045,157,78430,222,0001,159,0002,113,536
4Jul 25, 2026 21:593,79541,567,87130,349,0001,151,0002,113,536
5Jul 25, 2026 21:593,81241,624,88730,511,0001,133,0002,113,536
6Jul 25, 2026 21:593,86042,678,08430,895,0001,145,0002,113,536
7Jul 25, 2026 21:593,95142,896,21028,243,0004,557,0002,113,536
8Jul 25, 2026 21:594,06764,310,75329,114,0004,645,0002,117,632
9Jul 25, 2026 21:594,12754,040,23129,992,0004,269,00020,480