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 listSep 3, 2026 01:19CheckHarryCheckHarryScore: 6,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 01:206,20761,429,50650,351,0001,171,0002,113,536
2Sep 3, 2026 01:206,20861,410,48250,481,0001,051,0002,113,536
3Sep 3, 2026 01:206,20962,092,32950,484,0001,054,0002,113,536
4Sep 3, 2026 01:206,22061,535,33950,572,0001,057,0002,113,536
5Sep 3, 2026 01:206,22461,597,74850,613,0001,054,0002,113,536
6Sep 3, 2026 01:206,23062,653,92450,668,0001,047,0002,113,536
7Sep 3, 2026 01:206,23261,540,57350,675,0001,051,0002,113,536
8Sep 3, 2026 01:206,23861,771,87750,631,0001,151,0002,113,536
9Sep 3, 2026 01:206,25461,820,76750,873,0001,039,0002,113,536