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 16, 2026 18:50wnwnScore: 8,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 18:518,37899,499,18367,522,0002,015,0002,473,984
2Feb 16, 2026 18:508,44992,969,71767,118,0003,005,0002,416,640
3Feb 16, 2026 18:518,48992,820,51167,443,0003,019,0002,420,736
4Feb 16, 2026 18:518,52798,954,55566,790,0003,987,0002,441,216
5Feb 16, 2026 18:508,53897,761,49366,874,0003,992,0002,383,872
6Feb 16, 2026 18:508,68495,536,67869,074,0003,003,0002,469,888