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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 20:275,13750,457,20741,533,0001,111,0002,117,632stderr
2Jul 1, 2026 20:275,14150,539,94141,546,0001,131,0002,117,632stderr
3Jul 1, 2026 20:275,14850,439,27641,698,0001,036,0002,117,632stderr
4Jul 1, 2026 20:275,15150,532,49741,687,0001,072,0002,117,632stderr
5Jul 1, 2026 20:275,16150,650,32441,705,0001,135,0002,117,632stderr
6Jul 1, 2026 20:275,17350,635,59041,806,0001,135,0002,117,632stderr
7Jul 1, 2026 20:275,18150,733,90341,958,0001,045,0002,117,632stderr
8Jul 1, 2026 20:275,29151,742,57442,807,0001,111,0002,117,632stderr
9Jul 1, 2026 20:275,31651,963,20043,075,0001,050,0002,117,632stderr