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 25, 2026 20:46Maya RebholzMaya RebholzScore: 6,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:466,51964,875,44348,952,0005,158,0002,117,632
2May 25, 2026 20:466,59064,056,62949,422,0005,280,0002,117,632
3May 25, 2026 20:466,60866,401,26149,425,0005,425,0002,113,536
4May 25, 2026 20:466,66666,158,15150,183,0005,150,0002,117,632
5May 25, 2026 20:466,70965,624,61350,289,0005,401,0002,117,632
6May 25, 2026 20:466,83167,921,23751,312,0005,388,0002,113,536
7May 25, 2026 20:466,87167,183,31351,669,0005,368,0002,117,632
8May 25, 2026 20:466,91766,956,87252,053,0005,363,0002,117,632
9May 25, 2026 20:466,94570,666,63752,262,0005,388,0002,113,536