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 listOct 14, 2024 00:15Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:1500000Error: No answer to stdout. Died or killed?stderr
2Oct 14, 2024 00:154,62260,987,36436,343,0002,019,0002,277,376
3Oct 14, 2024 00:154,68961,851,72637,924,000998,0002,281,472
4Oct 14, 2024 00:154,70563,275,06937,046,0002,002,0002,514,944
5Oct 14, 2024 00:154,72260,384,40838,190,0001,005,0002,351,104
6Oct 14, 2024 00:154,73158,356,36037,252,0002,013,0002,506,752
7Oct 14, 2024 00:154,80963,387,02637,923,0001,995,0002,523,136