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 7, 2026 18:43Kevin HeaveyKevin HeaveyScore: 4,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 18:473,96242,412,68631,850,0001,037,0002,117,632
2Jul 7, 2026 18:473,96442,443,81831,861,0001,042,0002,117,632
3Jul 7, 2026 18:473,98742,648,78732,060,0001,038,0002,117,632
4Jul 7, 2026 18:474,05943,300,34132,661,0001,036,0002,117,632
5Jul 7, 2026 18:474,06343,290,90132,694,0001,037,0002,117,632
6Jul 7, 2026 18:474,06543,326,81532,707,0001,036,0002,117,632
7Jul 7, 2026 18:474,07243,349,34932,764,0001,036,0002,117,632
8Jul 7, 2026 18:474,07943,434,69232,821,0001,035,0002,117,632
9Jul 7, 2026 18:474,08143,382,79332,838,0001,035,0002,117,632