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 listJun 25, 2026 18:32Victor MerckléVictor MerckléScore: 12,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:3312,628112,488,469103,696,0001,118,0002,117,632stderr
2Jun 25, 2026 18:3312,643112,650,634103,825,0001,113,0002,117,632stderr
3Jun 25, 2026 18:3312,735113,344,710104,559,0001,145,0002,117,632stderr
4Jun 25, 2026 18:3312,738113,397,159104,607,0001,125,0002,117,632stderr
5Jun 25, 2026 18:3312,836114,236,025105,473,0001,071,0002,117,632stderr
6Jun 25, 2026 18:3312,852114,304,735105,636,0001,036,0002,117,632stderr
7Jun 25, 2026 18:3312,859114,333,783105,694,0001,036,0002,117,632stderr
8Jun 25, 2026 18:3312,859114,216,495105,690,0001,046,0002,117,632stderr
9Jun 25, 2026 18:3312,871114,257,423105,759,0001,074,0002,117,632stderr