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 listMar 1, 2026 14:37Kacper GrzybowskiKacper GrzybowskiScore: 72,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2026 14:3772,459627,691,816544,370,00057,038,0002,400,256
2Mar 1, 2026 14:3772,472631,108,534567,545,00033,972,0002,408,448
3Mar 1, 2026 14:3772,532625,973,384537,015,00065,001,0002,404,352