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 listFeb 19, 2026 05:18Josu San MartinJosu San MartinScore: 6,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 05:186,02875,727,06848,030,0002,001,0002,297,856
2Feb 19, 2026 05:186,07071,247,03450,381,00002,285,568
3Feb 19, 2026 05:186,12181,819,59149,807,000996,0002,289,664
4Feb 19, 2026 05:186,13775,407,77748,938,0001,997,0002,285,568
5Feb 19, 2026 05:186,21381,182,34749,549,0002,022,0002,367,488
6Feb 19, 2026 05:186,39873,591,07251,098,0002,003,0002,289,664