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 listSep 11, 2026 22:33Victor MerckléVictor MerckléScore: 20,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 22:3620,226177,637,688166,736,0001,146,0002,117,632stderr
2Sep 11, 2026 22:3620,266178,033,150167,199,0001,010,0002,117,632stderr
3Sep 11, 2026 22:3620,289178,240,062167,260,0001,145,0002,117,632stderr
4Sep 11, 2026 22:3620,305178,346,620167,512,0001,021,0002,117,632stderr
5Sep 11, 2026 22:3620,350178,719,459167,907,0001,004,0002,117,632stderr
6Sep 11, 2026 22:3620,418179,908,694168,385,0001,089,0002,117,632stderr
7Sep 11, 2026 22:3620,425180,090,572168,518,0001,014,0002,117,632stderr
8Sep 11, 2026 22:3620,437179,479,718168,626,0001,003,0002,117,632stderr
9Sep 11, 2026 22:3620,456180,233,683168,642,0001,150,0002,117,632stderr