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 listApr 27, 2024 12:26Joad NacerJoad NacerScore: 15,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 12:2615,399154,196,439125,814,0001,997,0002,260,992
2Apr 27, 2024 12:2615,513157,118,646128,754,00002,285,568
3Apr 27, 2024 12:2615,531154,318,803126,909,0001,998,0002,519,040
4Apr 27, 2024 12:2615,541156,000,372126,991,0001,999,0002,285,568
5Apr 27, 2024 12:2615,560155,633,826127,145,0002,002,0002,510,848
6Apr 27, 2024 12:2615,575154,152,458128,269,0001,002,0002,514,944
7Apr 27, 2024 12:2615,594155,495,992127,426,0002,006,0002,285,568
8Apr 27, 2024 12:2615,727158,289,392129,532,0001,004,0002,265,088
9Apr 27, 2024 12:2615,837156,606,105129,439,0002,006,0002,277,376
10Apr 27, 2024 12:2617,300202,850,490143,593,00402,293,760
11Apr 27, 2024 12:2618,046213,896,564149,778,65502,285,568
12Apr 27, 2024 12:2618,138209,415,359150,549,19802,281,472