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 1, 2025 17:25matsuoka-601matsuoka-601Score: 38,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2025 19:3038,490349,102,835318,462,0001,001,0002,326,528
2Jan 1, 2025 17:2538,493343,480,499316,491,0003,004,0002,543,616
3Jan 1, 2025 19:3038,502349,593,109318,564,0001,001,0002,326,528
4Jan 1, 2025 17:2538,517347,643,851316,697,0002,997,0002,326,528
5Jan 1, 2025 17:2538,548344,508,882317,946,0001,999,0002,285,568
6Jan 1, 2025 19:3038,701345,990,032318,217,0003,002,0002,326,528