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 listOct 13, 2024 23:41Joad NacerJoad NacerScore: 4,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 23:414,31857,148,23633,846,0001,990,0002,383,872
2Oct 13, 2024 23:414,32765,631,01233,923,0001,995,0002,297,856
3Oct 13, 2024 23:414,35963,361,89435,176,0001,005,0002,531,328
4Oct 13, 2024 23:414,38662,493,48335,391,0001,011,0002,306,048
5Oct 13, 2024 23:414,43463,357,49935,806,000994,0002,297,856
6Oct 13, 2024 23:414,76765,150,00838,552,0001,014,0002,531,328