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 22, 2026 20:25Kevin HeaveyKevin HeaveyScore: 57,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 20:263,99143,014,47132,096,0001,033,0002,113,536
2Jul 22, 2026 20:264,00243,043,07032,174,0001,043,0002,113,536
3Jul 22, 2026 20:2656,211476,411,831465,276,0001,281,0002,113,536
4Jul 22, 2026 20:2656,701480,458,069469,622,0001,002,0002,113,536
5Jul 22, 2026 20:2657,077483,695,671472,744,0001,002,0002,113,536
6Jul 22, 2026 20:2657,683488,739,081477,769,0001,002,0002,113,536
7Jul 22, 2026 20:2658,608497,011,891485,446,0001,005,0002,113,536
8Jul 22, 2026 20:2658,677496,883,162486,024,0001,002,0002,113,536
9Jul 22, 2026 20:2659,816509,167,386495,472,0001,003,0002,113,536