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 listJul 18, 2026 12:16boop34boop34Score: 8,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 12:178,96384,005,01373,393,0001,007,0002,113,536
2Jul 18, 2026 12:178,98084,800,57573,529,0001,007,0002,113,536
3Jul 18, 2026 12:178,98086,323,12273,526,0001,008,0002,113,536
4Jul 18, 2026 12:178,98084,200,16873,533,0001,007,0002,113,536
5Jul 18, 2026 12:178,98984,358,18273,599,0001,011,0002,113,536
6Jul 18, 2026 12:179,04084,655,96974,023,0001,013,0002,113,536
7Jul 18, 2026 12:179,06384,881,99274,204,0001,019,0002,113,536
8Jul 18, 2026 12:179,14985,506,81874,927,0001,010,0002,113,536
9Jul 18, 2026 12:179,22986,246,30775,600,0001,007,0002,113,536