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 5, 2026 13:14Kevin HeaveyKevin HeaveyScore: 20,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 13:1520,275177,479,444167,280,0001,004,0002,117,632
2Jul 5, 2026 13:1520,288177,565,138167,364,0001,031,0002,117,632
3Jul 5, 2026 13:1520,296177,654,374167,432,0001,030,0002,117,632
4Jul 5, 2026 13:1520,296177,669,712167,444,0001,013,0002,117,632
5Jul 5, 2026 13:1520,312177,800,755167,565,0001,026,0002,117,632
6Jul 5, 2026 13:1520,312177,881,939167,511,0001,086,0002,117,632
7Jul 5, 2026 13:1520,365178,222,928167,969,0001,068,0002,117,632
8Jul 5, 2026 13:1520,876182,484,215172,162,0001,115,0002,117,632
9Jul 5, 2026 13:1520,881182,433,168172,179,0001,137,0002,117,632