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 14, 2026 08:00Daniel MastalerzDaniel MastalerzScore: 7,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 08:007,32782,474,98957,820,0002,990,0002,486,272
2Feb 14, 2026 08:007,33286,386,69558,863,0001,995,0002,293,760
3Feb 14, 2026 08:007,33787,156,46657,899,0002,994,0002,486,272
4Feb 14, 2026 08:007,47085,076,17159,005,0003,000,0002,478,080
5Feb 14, 2026 08:007,47184,608,25659,008,0003,000,0002,289,664
6Feb 14, 2026 08:007,48089,564,58461,081,0001,001,0002,289,664