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 listSep 17, 2026 16:41Andrew EpsteinAndrew EpsteinScore: 9,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 16:449,78589,743,52280,115,0001,104,0002,117,632stderr
2Sep 17, 2026 16:449,83490,382,41780,567,0001,060,0002,117,632stderr
3Sep 17, 2026 16:449,83590,358,73080,579,0001,057,0002,117,632stderr
4Sep 17, 2026 16:449,85590,575,99880,738,0001,059,0002,117,632stderr
5Sep 17, 2026 16:449,85691,095,96380,736,0001,076,0002,117,632stderr
6Sep 17, 2026 16:449,87290,639,77080,870,0001,070,0002,117,632stderr
7Sep 17, 2026 16:449,88290,742,90280,965,0001,063,0002,117,632stderr
8Sep 17, 2026 16:449,92192,056,95781,300,0001,051,0002,117,632stderr
9Sep 17, 2026 16:449,93791,016,35881,361,0001,120,0002,117,632stderr