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 14:01Daniel MastalerzDaniel MastalerzScore: 5,696Success
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 14:015,60475,402,06443,478,0003,033,0002,265,088
2Feb 21, 2026 14:015,63372,317,74243,770,0002,984,0002,265,088
3Feb 21, 2026 14:015,63975,668,77542,817,0003,983,0002,523,136
4Feb 21, 2026 14:015,69675,510,13243,250,0004,023,0002,265,088
5Feb 21, 2026 14:015,69675,651,50543,254,0004,023,0002,318,336
6Feb 21, 2026 14:015,69769,460,94944,270,0003,018,0002,383,872