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 listFeb 20, 2026 13:37CheckHarryCheckHarryScore: 21,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 13:3720,817201,046,240170,786,0001,997,0002,510,848
2Feb 20, 2026 13:3721,282201,288,616175,645,000997,0002,510,848
3Feb 20, 2026 13:3721,439200,349,714173,942,0003,998,0002,281,472
4Feb 20, 2026 13:3721,450199,905,222177,035,0001,000,0002,363,392
5Feb 20, 2026 13:3721,454202,634,129176,070,0002,000,0002,281,472
6Feb 20, 2026 13:3721,458207,403,285176,112,0001,989,0002,285,568
7Feb 20, 2026 13:3721,473201,702,507177,225,0001,001,0002,502,656
8Feb 20, 2026 13:3721,474204,436,186176,229,0002,002,0002,506,752
9Feb 20, 2026 13:3721,477206,372,309176,254,0002,002,0002,281,472