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 listJun 10, 2026 13:11Victor MerckléVictor MerckléScore: 8,097Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 13:128,07674,554,18065,944,0001,094,0002,117,632stderr
2Jun 10, 2026 13:128,08174,592,27865,974,0001,100,0002,117,632stderr
3Jun 10, 2026 13:128,08674,546,65866,020,0001,102,0002,117,632stderr
4Jun 10, 2026 13:128,09174,597,79866,141,0001,015,0002,117,632stderr
5Jun 10, 2026 13:128,09774,783,68966,100,0001,109,0002,117,632stderr
6Jun 10, 2026 13:128,09974,779,46266,200,0001,027,0002,117,632stderr
7Jun 10, 2026 13:128,10274,642,08266,146,0001,102,0002,117,632stderr
8Jun 10, 2026 13:128,10574,685,51966,158,0001,118,0002,117,632stderr
9Jun 10, 2026 13:128,32676,831,56668,057,0001,050,0002,117,632stderr