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 listMay 7, 2026 08:37wnwnScore: 3,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 08:383,51543,554,33128,073,0001,105,0002,478,080
2May 7, 2026 08:383,54446,620,35028,341,0001,075,0002,490,368
3May 7, 2026 08:383,54945,178,73528,393,0001,068,0002,478,080
4May 7, 2026 08:383,55047,610,62828,349,0001,121,0002,490,368
5May 7, 2026 08:383,57845,367,27128,591,0001,109,0002,486,272
6May 7, 2026 08:383,58444,637,63328,661,0001,094,0002,482,176
7May 7, 2026 08:383,59245,791,32028,749,0001,071,0002,490,368
8May 7, 2026 08:383,59244,118,86328,705,0001,109,0002,482,176
9May 7, 2026 08:383,60544,506,29928,838,0001,087,0002,478,080