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 listSep 10, 2024 14:03Dmitrii KravchenkoDmitrii KravchenkoScore: 389,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2024 14:03388,6583,251,630,2783,140,918,00084,943,0002,289,664
2Sep 10, 2024 14:03389,5093,263,022,7383,150,977,00081,947,0002,293,760
3Sep 10, 2024 14:03389,8333,262,316,5353,156,650,00078,966,0002,293,760
4Sep 10, 2024 14:03389,8423,260,799,9213,163,715,00071,970,0002,510,848
5Sep 10, 2024 14:03389,8753,264,676,0463,163,986,00071,976,0002,510,848
6Sep 10, 2024 14:03390,1273,265,026,1073,169,098,00068,958,0002,285,568
7Sep 10, 2024 14:03390,9773,274,336,3123,170,153,00074,956,0002,293,760
8Sep 10, 2024 14:03391,9643,277,652,5363,195,333,00057,969,0002,510,848
9Sep 10, 2024 14:03392,1213,282,425,9203,192,633,00061,973,0002,293,760