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 20:26Alexander KosachevAlexander KosachevScore: 64,892Success
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 20:2664,807555,382,994537,902,00002,486,272
2Nov 12, 2024 20:2664,816560,212,386536,970,000999,0002,486,272
3Nov 12, 2024 20:2664,840562,368,158538,168,00002,527,232
4Nov 12, 2024 20:2664,857559,317,644537,317,0001,000,0002,531,328
5Nov 12, 2024 20:2664,892562,031,875538,606,00002,531,328
6Nov 12, 2024 20:2667,004578,269,922556,133,00002,478,080
7Nov 12, 2024 20:2671,511626,791,974591,545,0001,998,0002,478,080
8Nov 12, 2024 20:2671,512621,996,624592,547,000999,0002,478,080
9Nov 12, 2024 20:2671,524622,438,706592,649,000999,0002,482,176