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 2, 2026 21:46TonyTonyScore: 10,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 21:4710,40396,323,06084,280,0002,066,0002,113,536
2Aug 2, 2026 21:4710,40697,151,02084,275,0002,096,0002,113,536
3Aug 2, 2026 21:4710,44096,660,83984,570,0002,089,0002,117,632
4Aug 2, 2026 21:4710,44196,682,62184,562,0002,105,0002,113,536
5Aug 2, 2026 21:4710,44896,649,31784,626,0002,098,0002,113,536
6Aug 2, 2026 21:4710,44896,706,46883,919,0002,805,0002,113,536
7Aug 2, 2026 21:4710,46296,885,94584,754,0002,084,0002,113,536
8Aug 2, 2026 21:4710,468104,904,45584,761,0002,129,0002,117,632
9Aug 2, 2026 21:4710,47096,954,08584,805,0002,102,0002,113,536