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 21, 2026 22:57Mathaus Adorno PereiraMathaus Adorno PereiraScore: 251,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 22:57251,1712,114,359,1492,081,723,0002,998,0002,330,624
2Feb 21, 2026 22:57251,2672,109,395,7822,085,518,00002,330,624
3Feb 21, 2026 22:57251,2842,107,366,6972,084,660,000999,0002,498,560
4Feb 21, 2026 22:57251,3272,113,133,2192,084,013,0001,999,0002,322,432
5Feb 21, 2026 22:57251,3292,115,791,1412,084,028,0001,999,0002,330,624
6Feb 21, 2026 22:57251,3342,109,611,2532,084,073,0001,999,0002,375,680
7Feb 21, 2026 22:57251,3572,112,347,0432,084,267,0001,999,0002,322,432
8Feb 21, 2026 22:57251,3662,109,936,1512,084,338,0001,999,0002,330,624
9Feb 21, 2026 22:57251,4262,113,342,9492,083,839,0002,998,0002,322,432