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 01:04Christopher MullinsChristopher MullinsScore: 143,559Success
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 01:04143,4021,222,722,2101,188,242,0001,998,0002,322,432
2Dec 22, 2024 01:04143,4031,219,635,1761,187,244,0002,998,0002,322,432
3Dec 22, 2024 01:04143,5421,214,797,2691,189,402,0001,998,0002,322,432
4Dec 22, 2024 01:04143,5501,225,303,2811,189,470,0001,999,0002,322,432
5Dec 22, 2024 01:04143,5591,218,788,8371,189,539,0001,999,0002,473,984
6Dec 22, 2024 01:04143,6381,220,877,1991,189,199,0002,997,0002,322,432
7Dec 22, 2024 01:04143,6391,218,987,8371,188,209,0003,997,0002,310,144
8Dec 22, 2024 01:04143,6501,224,298,2981,190,299,0001,998,0002,322,432
9Dec 22, 2024 01:04143,8241,216,825,8721,191,744,0001,999,0002,478,080