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 24, 2026 19:58Maya RebholzMaya RebholzScore: 8,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 19:598,27080,275,61563,283,0005,363,0002,113,536
2May 24, 2026 19:598,29479,754,70063,115,0005,733,0002,113,536
3May 24, 2026 19:598,70686,705,45365,994,0006,273,0002,113,536
4May 24, 2026 19:598,84982,889,69167,674,0005,777,0002,113,536
5May 24, 2026 19:598,96189,214,42665,863,0008,520,0002,117,632
6May 24, 2026 19:598,99286,161,59768,735,0005,903,0002,117,632
7May 24, 2026 19:599,05290,433,37069,471,0005,661,0002,117,632
8May 24, 2026 19:599,07690,179,70669,428,0005,903,0002,117,632
9May 24, 2026 19:599,33791,638,38571,325,0006,179,0002,113,536