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 listJan 19, 2025 16:03Royal BhatiRoyal BhatiScore: 263,933Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 16:03263,7252,219,421,9242,102,957,00085,957,0002,326,528
2Jan 19, 2025 16:03263,7932,222,151,0442,105,502,00083,980,0002,326,528
3Jan 19, 2025 16:03263,8932,213,658,5992,088,390,000101,921,0002,326,528
4Jan 19, 2025 16:03263,9062,220,994,2062,103,440,00086,976,0002,326,528
5Jan 19, 2025 16:03263,9332,219,969,3912,090,710,00099,938,0002,326,528
6Jan 19, 2025 16:03264,0022,218,500,0552,101,292,00089,926,0002,326,528
7Jan 19, 2025 16:03264,0332,216,508,1012,091,544,00099,930,0002,322,432
8Jan 19, 2025 16:03264,0662,215,409,9392,083,812,000107,938,0002,326,528
9Jan 19, 2025 16:03264,1772,218,406,6362,097,727,00094,942,0002,326,528