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 listOct 9, 2025 15:15Serhat ErenSerhat ErenScore: 65,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2025 15:1565,707573,892,976543,364,0002,001,0002,396,160
2Oct 9, 2025 15:1565,713576,387,844543,418,0002,001,0002,269,184
3Oct 9, 2025 15:1565,713570,318,851544,421,0001,000,0002,392,064
4Oct 9, 2025 15:1565,714574,873,159543,428,0002,001,0002,269,184
5Oct 9, 2025 15:1565,726574,145,611543,524,0001,998,0002,269,184
6Oct 9, 2025 15:1565,726571,162,570544,528,000999,0002,269,184
7Oct 9, 2025 15:1565,727572,751,482543,537,0001,998,0002,269,184
8Oct 9, 2025 15:1565,729572,525,172543,551,0001,998,0002,269,184
9Oct 9, 2025 15:1565,735570,023,501542,605,0002,997,0002,269,184