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 02:03Kevin HeaveyKevin HeaveyScore: 3,744Success
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 02:043,70740,379,07729,742,0001,028,0002,117,632
2Jul 14, 2026 02:043,71540,460,40029,812,0001,028,0002,117,632
3Jul 14, 2026 02:043,72940,556,08029,931,0001,024,0002,117,632
4Jul 14, 2026 02:043,73340,599,89329,960,0001,026,0002,117,632
5Jul 14, 2026 02:043,74440,760,53130,053,0001,027,0002,117,632
6Jul 14, 2026 02:043,77541,011,63530,292,0001,044,0002,117,632
7Jul 14, 2026 02:043,79141,060,60830,427,0001,043,0002,117,632
8Jul 14, 2026 02:043,79441,150,08430,447,0001,045,0002,117,632
9Jul 14, 2026 02:043,79841,157,72730,488,0001,043,0002,117,632