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 8, 2024 17:41Alexey TarasovAlexey TarasovScore: 79,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2024 17:4179,150678,920,774654,944,0001,999,0002,293,760
2Nov 8, 2024 17:4179,188687,900,990656,262,0001,000,0002,293,760
3Nov 8, 2024 17:4179,224689,682,670655,558,0001,998,0002,293,760
4Nov 8, 2024 17:4179,247681,083,776656,747,000999,0002,281,472
5Nov 8, 2024 17:4179,250681,753,745656,773,000999,0002,367,488
6Nov 8, 2024 17:4179,259682,601,759655,851,0001,999,0002,293,760
7Nov 8, 2024 17:4179,259687,936,910655,851,0001,999,0002,371,584
8Nov 8, 2024 17:4179,262683,103,195655,876,0001,999,0002,293,760
9Nov 8, 2024 17:4179,276688,372,981656,994,000999,0002,293,760