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 14, 2026 10:47Victor MerckléVictor MerckléScore: 4,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 10:484,46346,860,75035,920,0001,126,0002,117,632stderr
2Sep 14, 2026 10:484,52048,242,31236,395,0001,126,0002,117,632stderr
3Sep 14, 2026 10:484,52348,029,63436,428,0001,121,0002,117,632stderr
4Sep 14, 2026 10:484,52748,191,09636,460,0001,120,0002,117,632stderr
5Sep 14, 2026 10:484,53147,913,25636,490,0001,124,0002,117,632stderr
6Sep 14, 2026 10:484,54148,156,57136,568,0001,129,0002,117,632stderr
7Sep 14, 2026 10:484,54747,588,89836,628,0001,119,0002,117,632stderr
8Sep 14, 2026 10:484,54748,182,14036,609,0001,133,0002,117,632stderr
9Sep 14, 2026 10:484,56147,666,53036,733,0001,124,0002,117,632stderr