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 listJul 18, 2026 17:14boop34boop34Score: 8,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 17:148,84383,002,92472,382,0001,020,0002,113,536
2Jul 18, 2026 17:148,85683,217,66472,486,0001,020,0002,113,536
3Jul 18, 2026 17:148,86583,255,22272,559,0001,023,0002,113,536
4Jul 18, 2026 17:148,90083,490,93372,852,0001,022,0002,113,536
5Jul 18, 2026 17:148,91883,660,49273,002,0001,020,0002,113,536
6Jul 18, 2026 17:148,91884,162,40373,006,0001,020,0002,113,536
7Jul 18, 2026 17:148,93283,758,52573,116,0001,022,0002,113,536
8Jul 18, 2026 17:148,95583,862,08073,312,0001,021,0002,113,536
9Jul 18, 2026 17:149,16085,674,46775,008,0001,020,0002,113,536