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 listAug 5, 2025 21:31Leon ZhaoLeon ZhaoScore: 58,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2025 21:3158,624517,374,832484,585,0001,998,0002,260,992
2Aug 5, 2025 21:3158,628512,474,474485,615,000999,0002,256,896
3Aug 5, 2025 21:3158,630515,145,500484,629,0001,998,0002,265,088
4Aug 5, 2025 21:3158,631513,149,379485,635,000999,0002,519,040
5Aug 5, 2025 21:3158,631512,945,995485,637,000999,0002,519,040
6Aug 5, 2025 21:3158,634510,540,215485,663,000999,0002,519,040
7Aug 5, 2025 21:3158,644514,265,420484,744,0001,998,0002,383,872
8Aug 5, 2025 21:3158,645514,582,130484,752,0001,998,0002,383,872
9Aug 5, 2025 21:3158,649517,684,699484,791,0001,999,0002,519,040