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 2, 2025 08:20matsuoka-601matsuoka-601Score: 23,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2025 08:2023,004216,625,252189,937,000999,0002,326,528
2Jan 2, 2025 08:2023,005215,725,741186,946,0003,998,0002,289,664
3Jan 2, 2025 08:2023,042211,770,226189,246,0002,002,0002,326,528