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 16, 2026 22:27Kevin HeaveyKevin HeaveyScore: 3,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 22:323,76140,952,22530,175,0001,043,0002,113,536
2Jul 16, 2026 22:323,78241,362,71230,373,0001,024,0002,113,536
3Jul 16, 2026 22:323,78741,237,86430,415,0001,025,0002,113,536
4Jul 16, 2026 22:323,78941,197,69330,425,0001,025,0002,113,536
5Jul 16, 2026 22:323,79041,240,80930,435,0001,027,0002,113,536
6Jul 16, 2026 22:323,84141,642,45830,845,0001,042,0002,113,536
7Jul 16, 2026 22:323,84541,684,50330,875,0001,042,0002,113,536
8Jul 16, 2026 22:323,86941,929,50531,070,0001,048,0002,113,536
9Jul 16, 2026 22:323,86941,861,78231,076,0001,044,0002,113,536