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 07:39Christopher MullinsChristopher MullinsScore: 143,440Success
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 07:39143,2831,216,879,8931,188,254,000999,0002,322,432
2Dec 22, 2024 07:39143,3051,219,268,1521,187,429,0001,999,0002,473,984
3Dec 22, 2024 07:39143,3681,215,660,9291,187,955,0001,999,0002,322,432
4Dec 22, 2024 07:39143,4321,219,652,9231,190,488,00002,322,432
5Dec 22, 2024 07:39143,4401,219,727,1741,187,553,0002,998,0002,322,432
6Dec 22, 2024 07:39143,4771,215,629,4471,188,861,0001,999,0002,322,432
7Dec 22, 2024 07:39143,5121,218,618,1771,188,151,0002,997,0002,322,432
8Dec 22, 2024 07:39143,5371,223,661,6021,189,363,0001,998,0002,322,432
9Dec 22, 2024 07:39143,6181,217,180,6021,191,026,0001,000,0002,310,144