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 20, 2024 16:17Dibash ThapaDibash ThapaScore: 75,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2024 16:1775,064644,938,050567,031,00056,003,0002,473,984
2Sep 20, 2024 16:1775,080650,508,537583,156,00040,010,0002,289,664
3Sep 20, 2024 16:1775,131652,341,829573,544,00050,047,0002,469,888
4Sep 20, 2024 16:1775,149646,957,311533,776,00089,962,0002,289,664
5Sep 20, 2024 16:1775,150647,135,361545,780,00077,968,0002,289,664
6Sep 20, 2024 16:1775,154646,605,206562,799,00060,978,0002,289,664
7Sep 20, 2024 16:1775,188649,703,448554,056,00070,007,0002,281,472
8Sep 20, 2024 16:1775,202652,158,074570,163,00054,015,0002,465,792
9Sep 20, 2024 16:1775,285652,581,500555,880,00068,985,0002,371,584