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 12, 2024 09:43Alexander KosachevAlexander KosachevScore: 138,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 09:43138,2991,175,380,1981,145,886,0001,998,0002,281,472
2Nov 12, 2024 09:43138,3041,172,108,5601,145,926,0001,998,0002,281,472
3Nov 12, 2024 09:43138,3101,172,759,4291,146,970,000999,0002,281,472
4Nov 12, 2024 09:43138,3111,172,567,6981,146,983,000999,0002,490,368
5Nov 12, 2024 09:43138,3201,172,794,8371,147,058,0001,000,0002,281,472
6Nov 12, 2024 09:43138,3211,175,948,9631,146,069,0001,998,0002,486,272
7Nov 12, 2024 09:43138,3211,177,136,1901,146,068,0001,998,0002,535,424
8Nov 12, 2024 09:43138,3291,174,304,9941,146,129,0001,998,0002,281,472
9Nov 12, 2024 09:43138,3521,184,210,4861,147,325,000999,0002,535,424