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 21:05Victor MerckléVictor MerckléScore: 7,726Success
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 21:067,71673,162,46062,996,0001,053,0002,117,632stderr
2May 13, 2026 21:067,71872,816,61862,949,0001,116,0002,117,632stderr
3May 13, 2026 21:067,72472,970,13362,948,0001,168,0002,117,632stderr
4May 13, 2026 21:067,72472,286,83063,000,0001,113,0002,117,632stderr
5May 13, 2026 21:067,72672,539,03363,027,0001,107,0002,117,632stderr
6May 13, 2026 21:067,72673,215,18063,009,0001,121,0002,117,632stderr
7May 13, 2026 21:067,72871,403,20163,017,0001,133,0002,117,632stderr
8May 13, 2026 21:067,73373,674,33263,068,0001,122,0002,117,632stderr
9May 13, 2026 21:067,81572,216,13763,755,0001,114,0002,117,632stderr