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 4, 2026 11:32limanjun99limanjun99Score: 4,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 11:324,48655,765,71134,954,0002,284,0002,498,560
2May 4, 2026 11:324,49954,430,94634,008,0003,335,0002,502,656
3May 4, 2026 11:324,50354,732,21134,091,0003,286,0002,502,656
4May 4, 2026 11:324,50855,372,81634,106,0003,313,0002,498,560
5May 4, 2026 11:324,52356,786,46934,222,0003,324,0002,506,752
6May 4, 2026 11:324,52655,784,98934,356,0003,210,0002,494,464
7May 4, 2026 11:324,53054,800,70035,334,0002,266,0002,490,368
8May 4, 2026 11:324,58255,721,78335,662,0002,371,0002,506,752
9May 4, 2026 11:324,59857,026,18434,942,0003,228,0002,498,560