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:25Andrew TsibinAndrew TsibinScore: 4,945Success
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:254,91550,559,29739,788,0001,010,0002,113,536
2Jul 14, 2026 23:254,91650,578,54739,798,0001,012,0002,113,536
3Jul 14, 2026 23:254,92550,485,96239,858,0001,022,0002,113,536
4Jul 14, 2026 23:254,93350,528,73139,922,0001,024,0002,113,536
5Jul 14, 2026 23:254,94550,697,79740,036,0001,010,0002,113,536
6Jul 14, 2026 23:254,95150,679,73940,076,0001,023,0002,113,536
7Jul 14, 2026 23:254,97050,856,16240,241,0001,016,0002,113,536
8Jul 14, 2026 23:254,97050,811,34440,250,0001,008,0002,113,536
9Jul 14, 2026 23:254,98851,009,36240,399,0001,009,0002,113,536