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 listApr 14, 2024 10:47Matt StuchlikMatt StuchlikScore: 20,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2024 10:4718,308219,557,173151,952,77402,301,952
2Apr 14, 2024 10:4718,315222,404,554152,017,30402,289,664
3Apr 14, 2024 10:4718,386225,471,332152,601,96302,293,760
4Apr 14, 2024 10:4720,068199,117,377166,563,00002,285,568
5Apr 14, 2024 10:4720,147196,536,383165,221,0002,002,0002,285,568
6Apr 14, 2024 10:4720,149189,639,165166,234,0001,001,0002,285,568
7Apr 14, 2024 10:4720,238191,306,384165,976,0001,999,0002,285,568
8Apr 14, 2024 10:4720,246193,864,800166,041,0002,000,0002,273,280
9Apr 14, 2024 10:4720,306198,502,509167,537,0001,003,0002,527,232
10Apr 14, 2024 10:4720,334200,111,786166,774,0001,997,0002,367,488
11Apr 14, 2024 10:4720,423198,894,385169,510,00002,285,568
12Apr 14, 2024 10:4720,523196,363,004170,345,00002,285,568