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 listFeb 21, 2026 12:28Daniel MastalerzDaniel MastalerzScore: 6,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 12:286,63281,124,71151,040,0004,003,0002,273,280
2Feb 21, 2026 12:286,63780,994,22652,086,0003,004,0002,531,328
3Feb 21, 2026 12:286,64278,452,10253,126,0002,004,0002,527,232
4Feb 21, 2026 12:286,73478,947,42551,901,0003,992,0002,273,280
5Feb 21, 2026 12:286,73978,749,18251,942,0003,995,0002,265,088
6Feb 21, 2026 12:286,76283,920,12553,122,0003,006,0002,301,952