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:06matsuoka-601matsuoka-601Score: 23,248Success
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:0723,228222,357,490190,797,0001,997,0002,527,232
2Jan 2, 2025 08:0723,244221,157,409191,927,000999,0002,326,528
3Jan 2, 2025 08:0623,247220,293,485191,949,000999,0002,326,528
4Jan 2, 2025 08:0623,248220,263,077191,961,000999,0002,519,040
5Jan 2, 2025 08:0723,257218,231,809192,029,0001,000,0002,326,528
6Jan 2, 2025 08:0623,259218,921,751191,046,0002,000,0002,326,528