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 15, 2026 19:25Daniel MastalerzDaniel MastalerzScore: 10,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 19:2610,002103,440,22480,019,0003,000,0002,297,856
2Feb 15, 2026 19:2610,017109,725,02881,140,0002,003,0002,297,856
3Feb 15, 2026 19:2610,095110,617,49580,795,0002,992,0002,269,184