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 listJun 18, 2026 14:17boop34boop34Score: 2,065,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 14:202,064,76517,147,459,43517,071,511,00066,039,0002,113,536
2Jun 18, 2026 14:202,065,21617,151,117,89417,075,070,00066,230,0002,113,536
3Jun 18, 2026 14:202,065,63017,155,471,92517,076,672,00068,059,0002,113,536
4Jun 18, 2026 14:202,065,67317,154,619,83317,079,048,00066,045,0002,113,536
5Jun 18, 2026 14:202,065,87717,156,242,34617,079,743,00067,042,0002,113,536
6Jun 18, 2026 14:202,066,22917,160,414,67017,081,660,00068,043,0002,113,536
7Jun 18, 2026 14:202,067,93017,173,299,16717,097,790,00066,035,0002,113,536
8Jun 18, 2026 14:202,071,84917,206,470,76617,129,115,00067,233,0002,113,536
9Jun 18, 2026 14:202,156,00917,904,363,41317,828,672,00066,203,0002,113,536