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:13Kevin HeaveyKevin HeaveyScore: 20,271Success
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:1418,504163,078,381152,448,0001,137,0002,117,632
2Jul 5, 2026 13:1418,513163,159,723152,602,0001,057,0002,117,632
3Jul 5, 2026 13:1418,832165,835,298155,158,0001,154,0002,117,632
4Jul 5, 2026 13:1420,267178,432,804167,157,0001,065,0002,117,632
5Jul 5, 2026 13:1420,271177,851,627167,167,0001,084,0002,117,632
6Jul 5, 2026 13:1420,293177,964,135167,310,0001,129,0002,117,632
7Jul 5, 2026 13:1420,300178,159,227167,338,0001,154,0002,117,632
8Jul 5, 2026 13:1420,300178,032,883167,354,0001,140,0002,117,632
9Jul 5, 2026 13:1420,309178,057,193167,422,0001,150,0002,117,632