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:01Daniel MastalerzDaniel MastalerzScore: 13,399Success
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:0113,380136,027,883106,055,0005,002,0002,400,256
2Feb 8, 2026 12:0113,393139,144,906104,148,0007,010,0002,322,432
3Feb 8, 2026 12:0113,395135,407,198104,164,0007,011,0002,387,968
4Feb 8, 2026 12:0113,396135,036,468108,180,0003,005,0002,301,952
5Feb 8, 2026 12:0113,399135,924,703109,206,0002,003,0002,396,160
6Feb 8, 2026 12:0113,435133,877,754104,540,0006,969,0002,486,272
7Feb 8, 2026 12:0113,553138,997,515112,487,00002,396,160
8Feb 8, 2026 12:0113,580141,857,834105,728,0006,982,0002,400,256
9Feb 8, 2026 12:0113,592139,448,134109,817,0002,995,0002,396,160