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 listSep 13, 2025 19:57Tony SolomonikTony SolomonikScore: 86,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 19:5786,686742,781,407487,655,000231,836,0002,285,568
2Sep 13, 2025 19:5786,708750,376,033489,778,000229,896,0002,412,544
3Sep 13, 2025 19:5786,730748,055,339488,229,000231,634,0002,387,968