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 10, 2024 23:08koenigskrautkoenigskrautScore: 124,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 23:08124,8381,061,918,2601,034,158,0001,998,0002,482,176
2Nov 10, 2024 23:08124,9281,062,571,7781,035,902,000999,0002,281,472
3Nov 10, 2024 23:08124,9401,057,914,8271,036,002,0001,000,0002,281,472
4Nov 10, 2024 23:08124,9471,062,657,2921,036,056,0001,000,0002,482,176
5Nov 10, 2024 23:08124,9941,060,465,2961,035,452,0001,998,0002,281,472
6Nov 10, 2024 23:08125,0061,062,250,9781,035,553,0001,999,0002,535,424
7Nov 10, 2024 23:08125,0251,063,763,5661,036,709,000999,0002,281,472
8Nov 10, 2024 23:08125,0731,067,092,7131,037,107,0001,000,0002,478,080
9Nov 10, 2024 23:08125,1571,059,239,9991,037,805,000999,0002,281,472