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 11:51Victor MerckléVictor MerckléScore: 49,103Success
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 11:5548,938416,047,869405,109,0001,077,0002,117,632stderr
2Sep 14, 2026 11:5549,003418,492,470405,552,0001,180,0002,117,632stderr
3Sep 14, 2026 11:5549,022417,386,280405,784,0001,102,0002,117,632stderr
4Sep 14, 2026 11:5549,033417,368,990405,952,0001,030,0002,117,632stderr
5Sep 14, 2026 11:5549,103417,881,825406,542,0001,018,0002,117,632stderr
6Sep 14, 2026 11:5549,200418,750,915407,352,0001,015,0002,117,632stderr
7Sep 14, 2026 11:5549,228418,527,249407,548,0001,048,0002,117,632stderr
8Sep 14, 2026 11:5549,233419,054,878407,628,0001,011,0002,117,632stderr
9Sep 14, 2026 11:5549,258419,224,700407,814,0001,028,0002,117,632stderr