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 20:06Kevin HeaveyKevin HeaveyScore: 3,778Success
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 20:073,76140,823,25830,197,0001,021,0002,117,632
2Jul 14, 2026 20:073,77140,886,18930,275,0001,026,0002,117,632
3Jul 14, 2026 20:073,77540,985,67730,312,0001,027,0002,117,632
4Jul 14, 2026 20:073,77640,888,28230,316,0001,026,0002,117,632
5Jul 14, 2026 20:073,77841,273,78430,341,0001,021,0002,117,632
6Jul 14, 2026 20:073,81441,295,93130,623,0001,039,0002,117,632
7Jul 14, 2026 20:073,82641,306,24830,721,0001,043,0002,117,632
8Jul 14, 2026 20:073,84041,543,64730,840,0001,040,0002,117,632
9Jul 14, 2026 20:073,85341,600,23430,947,0001,039,0002,117,632