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 18, 2026 05:53Kevin HeaveyKevin HeaveyScore: 3,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 06:003,59739,513,44328,635,0001,221,0002,117,632
2Jul 18, 2026 06:003,65540,072,11329,299,0001,041,0002,117,632
3Jul 18, 2026 06:003,67140,250,81329,298,0001,176,0002,117,632
4Jul 18, 2026 06:003,68940,359,43929,400,0001,223,0002,117,632
5Jul 18, 2026 06:003,76541,010,56030,040,0001,213,0002,117,632
6Jul 18, 2026 06:003,82741,485,09730,549,0001,216,0002,117,632
7Jul 18, 2026 06:003,84041,596,30330,680,0001,194,0002,117,632
8Jul 18, 2026 06:003,93542,308,35331,461,0001,202,0002,117,632
9Jul 18, 2026 06:003,99442,875,04231,947,0001,205,0002,117,632