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 25, 2024 07:46Javid izadiJavid izadiScore: 71,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 07:4671,500618,397,180420,613,000172,841,0002,289,664
2Dec 25, 2024 07:4671,508619,228,369416,660,000176,855,0002,371,584
3Dec 25, 2024 07:4671,616620,097,265417,589,000176,826,0002,334,720
4Dec 25, 2024 07:4671,630617,718,611416,668,000177,858,0002,297,856
5Dec 25, 2024 07:4671,639616,509,362417,720,000176,881,0002,265,088
6Dec 25, 2024 07:4671,667618,173,824419,882,000174,950,0002,502,656
7Dec 25, 2024 07:4671,744623,069,433417,633,000177,844,0002,273,280
8Dec 25, 2024 07:4671,751620,976,502418,673,000176,861,0002,277,376
9Dec 25, 2024 07:4672,052624,749,495418,321,000179,708,0002,392,064