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 listDec 26, 2024 22:19Joad NacerJoad NacerScore: 4,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2024 22:194,72459,731,88238,207,0001,005,0002,310,144
2Dec 26, 2024 22:194,74459,004,98038,370,0001,009,0002,293,760
3Dec 26, 2024 22:194,86961,481,46939,405,0001,010,0002,269,184
4Dec 26, 2024 22:194,87760,914,19738,456,0002,024,0002,297,856
5Dec 26, 2024 22:194,91965,796,88039,830,000995,0002,535,424
6Dec 26, 2024 22:194,92661,906,28538,893,0001,994,0002,301,952