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 listMay 7, 2024 14:25Steve HanSteve HanScore: 10,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2024 14:2510,309138,214,20585,564,74802,285,568
2May 7, 2024 14:2710,612155,284,78188,078,97302,277,376
3May 7, 2024 14:2710,613153,115,49788,089,22002,289,664
4May 7, 2024 14:2710,621143,097,64288,155,35502,281,472
5May 7, 2024 14:2510,722158,209,77088,990,22302,281,472
6May 7, 2024 14:2510,727141,819,43189,035,38502,269,184
7May 7, 2024 14:3211,154147,411,04592,580,04302,277,376
8May 7, 2024 14:3211,170152,070,01692,710,47302,285,568
9May 7, 2024 14:3211,218147,482,32893,107,78902,273,280