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 8, 2026 12:49Daniel MastalerzDaniel MastalerzScore: 11,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 12:4911,417121,949,01093,763,000997,0002,285,568
2Feb 8, 2026 12:4911,434120,168,02692,902,0001,997,0002,510,848
3Feb 8, 2026 12:4911,687127,566,68794,999,0001,999,0002,293,760
4Feb 8, 2026 12:4911,763129,488,07696,623,0001,006,0002,285,568
5Feb 8, 2026 12:4911,779124,380,42696,770,000997,0002,289,664
6Feb 8, 2026 12:4911,973121,330,97098,374,0001,003,0002,342,912