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 listJan 25, 2025 14:58bendnbendnScore: 297,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 14:59296,1712,488,716,5942,456,220,0001,998,0002,285,568
2Jan 25, 2025 14:58296,5252,485,239,9352,460,161,000999,0002,285,568
3Jan 25, 2025 14:59296,5852,488,656,0072,459,657,0001,998,0002,285,568
4Jan 25, 2025 14:59297,6722,497,818,4212,468,679,0001,998,0002,289,664
5Jan 25, 2025 14:58297,9112,497,415,2142,470,665,0001,998,0002,285,568
6Jan 25, 2025 14:58301,8562,536,001,4252,501,407,0003,997,0002,289,664