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 10, 2026 19:02Daniel MastalerzDaniel MastalerzScore: 8,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 19:028,40391,254,44065,758,0003,985,0002,519,040
2Feb 10, 2026 19:028,41793,752,05265,867,0003,991,0002,338,816
3Feb 10, 2026 19:028,46298,364,79264,215,0006,020,0002,265,088
4Feb 10, 2026 19:028,58194,118,04366,210,0005,015,0002,269,184
5Feb 10, 2026 19:028,59694,142,35168,329,0003,014,0002,371,584
6Feb 10, 2026 19:028,648100,573,67167,794,0003,987,0002,281,472