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 listJul 30, 2026 15:05CodeReclaimersCodeReclaimersScore: 25,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 15:0625,933225,169,651214,163,0001,084,0002,113,536
2Jul 30, 2026 15:0625,935225,116,278214,166,0001,100,0002,113,536
3Jul 30, 2026 15:0625,939225,106,911214,231,0001,069,0002,113,536
4Jul 30, 2026 15:0625,942225,211,980214,234,0001,089,0002,113,536
5Jul 30, 2026 15:0625,943225,251,063214,245,0001,082,0002,113,536
6Jul 30, 2026 15:0625,943225,297,023214,251,0001,077,0002,113,536
7Jul 30, 2026 15:0625,945225,195,325214,273,0001,071,0002,113,536
8Jul 30, 2026 15:0625,952225,306,035214,304,0001,098,0002,113,536
9Jul 30, 2026 15:0625,970225,434,473214,354,0001,203,0002,113,536