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 9, 2026 23:54Andrii StolitniiAndrii StolitniiScore: 80,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:5480,505685,258,379595,032,00073,162,0002,334,720
2May 9, 2026 23:5480,544683,810,326595,051,00073,472,0002,334,720
3May 9, 2026 23:5480,685687,664,786596,039,00073,648,0002,330,624
4May 9, 2026 23:5480,698685,215,094596,275,00073,520,0002,322,432
5May 9, 2026 23:5480,744686,265,844595,986,00074,190,0002,330,624
6May 9, 2026 23:5480,770690,768,825596,147,00074,247,0002,330,624
7May 9, 2026 23:5480,786688,915,005595,882,00074,642,0002,326,528
8May 9, 2026 23:5480,825690,679,568596,488,00074,367,0002,330,624
9May 9, 2026 23:5480,833685,433,645596,017,00074,898,0002,330,624