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:16Andrew TsibinAndrew TsibinScore: 5,061Success
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:175,00151,162,35440,500,0001,010,0002,113,536
2Jul 14, 2026 23:175,00351,709,84340,502,0001,024,0002,113,536
3Jul 14, 2026 23:175,00351,738,51640,508,0001,017,0002,113,536
4Jul 14, 2026 23:175,04652,090,54240,864,0001,020,0002,113,536
5Jul 14, 2026 23:175,06151,567,01241,008,0001,006,0002,113,536
6Jul 14, 2026 23:175,06452,247,01141,030,0001,008,0002,113,536
7Jul 14, 2026 23:175,06951,741,31741,069,0001,009,0002,113,536
8Jul 14, 2026 23:175,07351,797,43740,907,0001,206,0002,113,536
9Jul 14, 2026 23:175,08351,762,67641,052,0001,139,0002,113,536