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:39matsuoka-601matsuoka-601Score: 20,705Success
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:4020,677201,389,605167,606,0004,014,0002,539,520
2Jan 2, 2025 08:4020,693197,632,298168,758,0002,995,0002,318,336
3Jan 2, 2025 08:3920,697197,476,719168,793,0002,996,0002,535,424
4Jan 2, 2025 08:3920,705202,187,385168,851,0002,997,0002,318,336
5Jan 2, 2025 08:4020,711197,763,890168,903,0002,998,0002,318,336
6Jan 2, 2025 08:3920,712201,288,057169,912,0001,998,0002,539,520