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 11, 2025 17:37vahookvahookScore: 5,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2025 17:375,24968,469,56740,527,0003,039,0002,404,352
2May 11, 2025 17:375,27868,816,11940,820,0002,986,0002,527,232
3May 11, 2025 17:375,31067,882,41239,066,0005,008,0002,400,256
4May 11, 2025 17:375,31663,253,71241,116,0003,008,0002,404,352
5May 11, 2025 17:375,32164,849,63940,152,0004,015,0002,527,232
6May 11, 2025 17:375,32963,993,33141,217,0003,015,0002,396,160
7May 11, 2025 17:375,33267,775,32942,243,0002,011,0002,404,352
8May 11, 2025 17:375,33471,206,66739,244,0005,031,0002,527,232
9May 11, 2025 17:375,33964,725,86240,289,0004,028,0002,445,312
10May 11, 2025 17:375,35073,720,30639,359,0005,046,0002,527,232
11May 11, 2025 17:375,35970,639,42142,455,0002,021,0002,400,256
12May 11, 2025 17:375,37871,557,55841,594,0003,043,0002,416,640