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 6, 2025 00:20Leon ZhaoLeon ZhaoScore: 48,213Success
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 23:5348,166427,155,058397,777,0001,998,0002,510,848
2Aug 5, 2025 23:5348,192425,060,350398,998,000999,0002,379,776
3Aug 6, 2025 00:2048,208422,978,129398,130,0002,000,0002,256,896
4Aug 5, 2025 23:5348,213425,122,233400,167,00002,387,968
5Aug 6, 2025 00:2048,221423,943,805400,236,00002,510,848
6Aug 6, 2025 00:2048,226431,463,367400,276,00002,383,872