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 listDec 12, 2023 14:37Mikhail SmirnovMikhail SmirnovScore: 1,643,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2023 14:381,641,65513,694,000,68213,625,733,76802,256,896
2Dec 12, 2023 14:381,641,87913,693,323,37913,627,592,06402,244,608
3Dec 12, 2023 14:371,642,19913,697,144,15013,630,253,89102,265,088
4Dec 12, 2023 14:381,643,13613,703,814,27013,638,028,72002,252,800
5Dec 12, 2023 14:371,649,54513,762,450,51413,691,226,86302,248,704
6Dec 12, 2023 14:371,664,10413,906,988,76913,812,059,65202,256,896