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 5, 2026 20:25Victor MerckléVictor MerckléScore: 5,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:265,55153,952,37845,046,0001,030,0002,117,632stderr
2Jul 5, 2026 20:265,55253,914,09245,064,0001,019,0002,117,632stderr
3Jul 5, 2026 20:265,55354,024,80345,056,0001,039,0002,117,632stderr
4Jul 5, 2026 20:265,56254,013,85245,134,0001,037,0002,117,632stderr
5Jul 5, 2026 20:265,56354,051,70345,133,0001,041,0002,117,632stderr
6Jul 5, 2026 20:265,56354,009,59745,119,0001,062,0002,117,632stderr
7Jul 5, 2026 20:265,56554,714,90045,083,0001,108,0002,117,632stderr
8Jul 5, 2026 20:265,56854,056,70445,126,0001,094,0002,117,632stderr
9Jul 5, 2026 20:265,57454,558,67745,097,0001,173,0002,117,632stderr