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 22, 2024 00:03Christopher MullinsChristopher MullinsScore: 282,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 00:03282,8072,374,966,8602,345,299,0001,998,0002,465,792
2Dec 22, 2024 00:03282,8142,372,528,3212,347,357,00002,310,144
3Dec 22, 2024 00:03282,8202,374,717,6612,345,410,0001,999,0002,322,432
4Dec 22, 2024 00:03282,8342,381,068,7122,347,523,00002,322,432
5Dec 22, 2024 00:03282,8442,374,580,6022,345,605,0001,998,0002,469,888
6Dec 22, 2024 00:03282,8462,375,192,9102,345,627,0001,998,0002,322,432
7Dec 22, 2024 00:03282,8642,381,792,7372,344,770,0002,998,0002,322,432
8Dec 22, 2024 00:03283,0822,381,623,3772,344,587,0004,996,0002,322,432
9Dec 22, 2024 00:03283,2942,378,738,2142,348,340,0002,999,0002,322,432