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 20, 2024 22:00zielajzielajScore: 3,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 22:003,59756,341,44527,862,0001,990,0002,383,872
2Nov 20, 2024 22:003,59759,278,10327,861,0001,990,0002,527,232
3Nov 20, 2024 22:003,60956,226,36227,961,0001,997,0002,527,232
4Nov 20, 2024 22:003,79052,582,78430,443,0001,014,0002,383,872
5Nov 20, 2024 22:003,80358,520,77230,550,0001,018,0002,392,064
6Nov 20, 2024 22:003,85256,776,00529,973,0001,998,0002,387,968