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 listJun 4, 2025 05:07thatmagicalcatthatmagicalcatScore: 81,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 05:0780,853694,613,442670,081,0001,000,0002,359,296
2Jun 4, 2025 05:0780,996702,655,858671,267,0001,000,0002,285,568
3Jun 4, 2025 05:0781,016697,852,696670,437,0001,998,0002,285,568
4Jun 4, 2025 05:0781,059698,047,122671,792,000999,0002,285,568
5Jun 4, 2025 05:0781,091699,807,544672,058,0001,000,0002,285,568
6Jun 4, 2025 05:0781,296702,064,532672,759,0001,999,0002,285,568
7Jun 4, 2025 05:0781,405700,765,695672,661,0002,998,0002,285,568
8Jun 4, 2025 05:0781,461701,553,238675,124,0001,000,0002,285,568
9Jun 4, 2025 05:0781,496704,810,384674,417,0001,998,0002,285,568