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 listOct 9, 2024 02:17MikeMikeScore: 265,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 02:17264,9682,224,476,5682,095,320,000103,916,0002,326,528
2Oct 9, 2024 02:17265,0002,231,287,9932,111,561,00087,940,0002,326,528
3Oct 9, 2024 02:17265,0672,222,787,7552,110,095,00089,961,0002,326,528
4Oct 9, 2024 02:17265,3052,239,557,5902,125,069,00076,966,0002,326,528
5Oct 9, 2024 02:17265,3082,229,493,1052,100,148,000101,910,0002,326,528
6Oct 9, 2024 02:17265,3232,228,071,5442,115,210,00086,967,0002,326,528
7Oct 9, 2024 02:17265,3882,233,188,9832,111,770,00090,947,0002,326,528
8Oct 9, 2024 02:17265,4962,227,970,7422,122,664,00080,949,0002,330,624
9Oct 9, 2024 02:17265,5662,231,139,8662,119,264,00084,930,0002,326,528