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 listNov 15, 2024 01:12zielajzielajScore: 3,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 01:123,71954,118,72229,875,000995,0002,523,136
2Nov 15, 2024 01:123,72051,414,50729,848,0001,029,0002,523,136
3Nov 15, 2024 01:123,72853,391,35929,941,000998,0002,269,184
4Nov 15, 2024 01:123,73158,663,01229,971,000999,0002,527,232
5Nov 15, 2024 01:123,73456,196,11029,995,000999,0002,527,232
6Nov 15, 2024 01:123,73453,011,17828,995,0001,999,0002,347,008
7Nov 15, 2024 01:123,73657,125,76630,009,0001,000,0002,523,136
8Nov 15, 2024 01:123,73953,527,00530,034,0001,001,0002,342,912
9Nov 15, 2024 01:123,74852,213,89829,101,0002,007,0002,351,104
10Nov 15, 2024 01:123,84556,710,87129,921,0001,994,0002,363,392
11Nov 15, 2024 01:123,86555,428,99432,081,00002,277,376
12Nov 15, 2024 01:123,87653,149,10031,166,0001,005,0002,531,328