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 12, 2026 13:08Kevin HeaveyKevin HeaveyScore: 4,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 13:104,03643,068,00132,283,0001,221,0002,117,632
2Jul 12, 2026 13:104,04343,237,33832,344,0001,214,0002,117,632
3Jul 12, 2026 13:104,04843,238,84432,563,0001,041,0002,117,632
4Jul 12, 2026 13:104,04944,838,43432,390,0001,224,0002,117,632
5Jul 12, 2026 13:104,05443,323,01332,610,0001,041,0002,117,632
6Jul 12, 2026 13:104,05643,365,85532,622,0001,044,0002,117,632
7Jul 12, 2026 13:104,06543,363,36632,707,0001,040,0002,117,632
8Jul 12, 2026 13:104,21046,443,27333,903,0001,041,0002,117,632
9Jul 12, 2026 13:104,23344,811,07233,906,0001,236,0002,117,632