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 listNov 24, 2025 20:47Ham-HamHam-HamScore: 186,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2025 20:47186,2191,579,364,7831,491,631,00053,986,0002,281,472
2Nov 24, 2025 20:47186,2431,568,625,0801,468,877,00076,941,0002,281,472
3Nov 24, 2025 20:47186,2471,576,485,5821,486,891,00058,956,0002,281,472
4Nov 24, 2025 20:47186,4261,571,164,8881,474,365,00072,968,0002,347,008
5Nov 24, 2025 20:47186,6131,573,926,4751,476,939,00071,948,0002,285,568
6Nov 24, 2025 20:47186,6441,572,302,1201,481,187,00067,962,0002,289,664
7Nov 24, 2025 20:47186,8291,580,613,6661,481,698,00068,985,0002,289,664
8Nov 24, 2025 20:47187,2661,580,251,5061,490,333,00063,971,0002,289,664
9Nov 24, 2025 20:47189,1961,595,187,8221,495,358,00074,967,0002,289,664