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 20, 2026 20:57Pavel KrajcevskiPavel KrajcevskiScore: 58,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 20:5958,924499,975,868482,727,0006,348,0002,134,016
2May 20, 2026 20:5958,925501,510,130483,008,0006,072,0002,134,016
3May 20, 2026 20:5958,925500,217,956483,036,0006,045,0002,134,016
4May 20, 2026 20:5958,926501,704,189483,061,0006,033,0002,134,016
5May 20, 2026 20:5958,939499,160,827484,950,0004,251,0002,134,016
6May 20, 2026 20:5958,941499,772,231483,153,0006,061,0002,134,016
7May 20, 2026 20:5958,965502,430,634483,221,0006,190,0002,134,016
8May 20, 2026 20:5958,981502,759,014483,507,0006,041,0002,134,016
9May 20, 2026 20:5959,023502,186,284483,794,0006,099,0002,134,016