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 listMay 13, 2026 19:19Victor MerckléVictor MerckléScore: 69,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:2069,816586,836,285578,326,0001,153,0002,117,632stderr
2May 13, 2026 19:2069,851588,057,644578,608,0001,161,0002,117,632stderr
3May 13, 2026 19:2069,874587,285,756578,831,0001,131,0002,117,632stderr
4May 13, 2026 19:2069,926590,627,129579,240,0001,150,0002,117,632stderr
5May 13, 2026 19:2069,937590,989,817579,368,0001,111,0002,117,632stderr
6May 13, 2026 19:2069,977588,138,462579,713,0001,099,0002,117,632stderr
7May 13, 2026 19:2070,001590,385,004579,865,0001,149,0002,117,632stderr
8May 13, 2026 19:2070,066589,400,292580,496,0001,056,0002,117,632stderr
9May 13, 2026 19:2070,192590,417,922581,574,0001,020,0002,117,632stderr