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 21, 2026 05:02Kevin HeaveyKevin HeaveyScore: 71,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 05:0469,506586,562,634574,768,0002,138,0002,113,536
2Jul 21, 2026 05:0470,536595,111,820583,282,0002,170,0002,113,536
3Jul 21, 2026 05:0470,721596,645,424584,833,0002,153,0002,113,536
4Jul 21, 2026 05:0471,211601,477,934589,050,0002,006,0002,113,536
5Jul 21, 2026 05:0471,806605,546,610593,989,0002,003,0002,113,536
6Jul 21, 2026 05:0472,528613,969,321599,827,0002,158,0002,113,536
7Jul 21, 2026 05:0476,223642,330,468630,475,0002,176,0002,113,536
8Jul 21, 2026 05:0476,700646,277,080633,467,0003,143,0002,113,536
9Jul 21, 2026 05:0477,911656,386,717644,478,0002,184,0002,113,536