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:47Kacper GrzybowskiKacper GrzybowskiScore: 56,415Success
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:4755,388488,023,430389,761,00069,957,0002,502,656
2Mar 1, 2026 14:4756,415494,702,767396,360,00071,884,0002,465,792
3Mar 1, 2026 14:4756,664493,092,296399,417,00070,896,0002,347,008