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 19, 2026 21:49Daniel MastalerzDaniel MastalerzScore: 6,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 21:496,06174,150,96846,281,0004,024,0002,277,376
2Feb 19, 2026 21:496,11881,336,14846,794,0003,982,0002,265,088
3Feb 19, 2026 21:496,12576,827,63447,850,0002,990,0002,322,432
4Feb 19, 2026 21:496,15373,401,42548,070,0003,004,0002,269,184
5Feb 19, 2026 21:496,21778,990,69748,568,0003,035,0002,326,528
6Feb 19, 2026 21:496,33279,779,72750,533,0002,021,0002,322,432