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 8, 2024 17:52Alexey TarasovAlexey TarasovScore: 70,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2024 17:5370,326612,421,857581,710,0001,999,0002,359,296
2Nov 8, 2024 17:5370,337612,441,032582,802,000999,0002,293,760
3Nov 8, 2024 17:5370,351611,211,372582,913,000999,0002,293,760
4Nov 8, 2024 17:5270,367610,630,716583,048,0001,000,0002,359,296
5Nov 8, 2024 17:5270,432613,739,922582,587,0001,998,0002,293,760
6Nov 8, 2024 17:5270,554610,328,874584,603,000999,0002,359,296