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:43Tony SolomonikTony SolomonikScore: 54,707Success
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:4354,628482,578,250394,492,00058,924,0002,285,568
2Sep 13, 2025 19:4354,707482,272,704380,061,00074,011,0002,449,408
3Sep 13, 2025 19:4354,814476,197,208394,965,00059,994,0002,355,200