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 31, 2024 22:14howspookyhowspookyScore: 1,882,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2024 22:141,880,94615,641,580,02315,537,889,00073,966,0002,281,472
2Oct 31, 2024 22:141,881,10215,648,284,27015,556,173,00056,974,0002,281,472
3Oct 31, 2024 22:141,881,25315,651,285,90815,537,441,00076,962,0002,281,472
4Oct 31, 2024 22:141,881,76115,648,515,09815,560,640,00057,976,0002,289,664
5Oct 31, 2024 22:141,882,20015,659,224,04515,562,284,00059,974,0002,293,760
6Oct 31, 2024 22:141,882,45115,656,320,85915,563,374,00060,970,0002,281,472
7Oct 31, 2024 22:141,885,54515,683,544,68815,586,045,00063,975,0002,281,472
8Oct 31, 2024 22:141,886,71615,692,748,05415,601,765,00057,976,0002,293,760
9Oct 31, 2024 22:141,896,38915,772,402,20515,676,056,00063,971,0002,281,472