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 17, 2026 01:12Andrew EpsteinAndrew EpsteinScore: 3,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 01:133,49239,071,74727,886,0001,105,0002,113,536
2Sep 17, 2026 01:133,55039,503,16128,358,0001,110,0002,113,536
3Sep 17, 2026 01:133,56439,712,57628,472,0001,113,0002,113,536
4Sep 17, 2026 01:133,60340,078,10128,804,0001,106,0002,113,536
5Sep 17, 2026 01:133,62140,251,68928,944,0001,112,0002,113,536
6Sep 17, 2026 01:133,62540,208,80128,977,0001,114,0002,113,536
7Sep 17, 2026 01:133,63340,306,95229,025,0001,129,0002,113,536
8Sep 17, 2026 01:133,64440,502,27629,136,0001,114,0002,113,536
9Sep 17, 2026 01:133,66241,243,34529,288,0001,111,0002,113,536