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 20, 2026 21:37Kevin HeaveyKevin HeaveyScore: 9,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 21:409,16385,746,64974,012,0002,043,0002,117,632
2Jul 20, 2026 21:409,24786,541,87874,742,0002,013,0002,117,632
3Jul 20, 2026 21:409,29586,905,76975,139,0002,015,0002,117,632
4Jul 20, 2026 21:409,29586,841,26975,113,0002,037,0002,117,632
5Jul 20, 2026 21:409,30286,922,24075,199,0002,008,0002,117,632
6Jul 20, 2026 21:409,39387,718,23175,925,0002,041,0002,117,632
7Jul 20, 2026 21:4010,080102,342,43981,630,0002,034,0002,117,632
8Jul 20, 2026 21:4020,526180,135,240168,352,0002,022,0002,117,632
9Jul 20, 2026 21:4020,646181,041,905169,331,0002,036,0002,117,632