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 21, 2026 06:01Pavel KrajcevskiPavel KrajcevskiScore: 64,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 06:0264,588546,457,889530,926,0005,161,0002,125,824
2May 21, 2026 06:0264,598548,989,519531,071,0005,093,0002,125,824
3May 21, 2026 06:0264,600549,108,911530,986,0005,200,0002,125,824
4May 21, 2026 06:0264,608548,585,321531,012,0005,240,0002,125,824
5May 21, 2026 06:0264,613549,071,347531,098,0005,192,0002,125,824
6May 21, 2026 06:0264,626546,774,720531,287,0005,116,0002,125,824
7May 21, 2026 06:0264,645546,423,367531,328,0005,232,0002,125,824
8May 21, 2026 06:0264,657547,244,257531,519,0005,142,0002,125,824
9May 21, 2026 06:0264,670547,106,783531,669,0005,094,0002,125,824