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 listNov 11, 2024 08:34AndreyAndreyScore: 1,826,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 08:341,825,47215,182,532,68415,076,451,00074,967,0002,289,664
2Nov 11, 2024 08:341,825,80815,181,725,49615,079,235,00074,971,0002,281,472
3Nov 11, 2024 08:341,826,00715,191,724,47515,089,897,00065,964,0002,293,760
4Nov 11, 2024 08:341,826,19215,192,663,94915,076,442,00080,954,0002,289,664
5Nov 11, 2024 08:341,826,21215,196,819,44915,089,601,00067,957,0002,281,472
6Nov 11, 2024 08:341,826,39915,193,499,38615,087,157,00071,957,0002,293,760
7Nov 11, 2024 08:341,826,69015,194,596,66515,093,559,00067,966,0002,355,200
8Nov 11, 2024 08:341,830,50215,228,628,40515,127,202,00065,965,0002,523,136
9Nov 11, 2024 08:341,831,70815,238,840,36215,140,217,00062,963,0002,281,472