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, 2025 01:54etherealetherealScore: 84,067Success
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, 2025 01:5484,044726,501,961695,569,0001,998,0002,322,432
2May 25, 2025 01:5484,046721,615,032694,583,0002,998,0002,322,432
3May 25, 2025 01:5484,057727,314,431695,672,0001,999,0002,322,432
4May 25, 2025 01:5484,061726,258,501696,708,000999,0002,457,600
5May 25, 2025 01:5484,067722,838,977695,756,0001,999,0002,322,432
6May 25, 2025 01:5484,067722,814,519694,762,0002,998,0002,322,432
7May 25, 2025 01:5484,091720,566,514695,960,0001,999,0002,322,432
8May 25, 2025 01:5484,100722,717,515695,034,0003,000,0002,322,432
9May 25, 2025 01:5484,103723,161,582696,053,0002,000,0002,322,432