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 14, 2026 23:53Kevin HeaveyKevin HeaveyScore: 3,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 23:543,69740,330,85029,507,0001,186,0002,117,632
2Jul 14, 2026 23:543,72340,491,51529,844,0001,057,0002,117,632
3Jul 14, 2026 23:543,73240,588,90129,956,0001,023,0002,117,632
4Jul 14, 2026 23:543,73740,702,84429,989,0001,029,0002,117,632
5Jul 14, 2026 23:543,74040,766,66430,027,0001,021,0002,117,632
6Jul 14, 2026 23:543,74540,768,75830,045,0001,040,0002,117,632
7Jul 14, 2026 23:543,75240,735,42730,122,0001,026,0002,117,632
8Jul 14, 2026 23:543,82341,350,36130,699,0001,039,0002,117,632
9Jul 14, 2026 23:543,83546,930,92730,792,0001,041,0002,117,632