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 03:56CheckHarryCheckHarryScore: 6,670Success
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 03:576,66165,168,10654,119,0001,171,0002,113,536
2Sep 3, 2026 03:576,66665,229,86354,273,0001,060,0002,113,536
3Sep 3, 2026 03:576,66765,158,12754,297,0001,043,0002,113,536
4Sep 3, 2026 03:576,66965,223,73654,289,0001,064,0002,113,536
5Sep 3, 2026 03:576,67065,170,79454,304,0001,058,0002,113,536
6Sep 3, 2026 03:576,67165,244,35854,321,0001,056,0002,113,536
7Sep 3, 2026 03:576,67465,187,06654,349,0001,049,0002,113,536
8Sep 3, 2026 03:576,67865,303,83154,344,0001,084,0002,113,536
9Sep 3, 2026 03:576,72965,722,96754,685,0001,170,0002,113,536