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 24, 2024 01:48MatthiasMatthiasScore: 31,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2024 01:4831,263283,204,056259,485,00002,289,664
2Nov 24, 2024 01:4831,267289,029,134258,516,0001,002,0002,293,760
3Nov 24, 2024 01:4831,273288,389,096259,566,00002,289,664
4Nov 24, 2024 01:4831,282286,153,104257,645,0001,997,0002,269,184
5Nov 24, 2024 01:4831,290286,384,010257,714,0001,997,0002,269,184
6Nov 24, 2024 01:4831,295287,990,866257,754,0001,998,0002,281,472
7Nov 24, 2024 01:4831,298285,987,673257,775,0001,998,0002,289,664
8Nov 24, 2024 01:4831,305286,051,975257,834,0001,998,0002,289,664
9Nov 24, 2024 01:4831,307284,451,423258,852,000999,0002,265,088