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 listOct 2, 2026 02:47Karthik ReddyKarthik ReddyScore: 6,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 02:476,11659,711,04549,701,0001,065,0002,113,536
2Oct 2, 2026 02:476,32461,411,20251,461,0001,032,0002,113,536
3Oct 2, 2026 02:476,47663,219,89052,636,0001,120,0002,113,536
4Oct 2, 2026 02:476,55963,637,04753,314,0001,128,0002,113,536
5Oct 2, 2026 02:476,65164,235,82054,027,0001,183,0002,113,536
6Oct 2, 2026 02:476,67564,394,71654,281,0001,127,0002,113,536
7Oct 2, 2026 02:476,74164,863,43954,831,0001,122,0002,113,536
8Oct 2, 2026 02:476,81066,062,30155,410,0001,113,0002,113,536
9Oct 2, 2026 02:476,92866,466,21456,387,0001,121,0002,113,536