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 listMay 25, 2026 16:46Kenzie_RTKenzie_RTScore: 124,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:47123,6571,036,751,8821,025,249,0001,111,0002,113,536
2May 25, 2026 16:47123,8371,038,025,0601,026,757,0001,094,0002,113,536
3May 25, 2026 16:47124,0511,041,160,6631,028,513,0001,115,0002,113,536
4May 25, 2026 16:47124,0701,039,185,2781,028,741,0001,045,0002,113,536
5May 25, 2026 16:47124,2461,041,048,4041,030,156,0001,091,0002,113,536
6May 25, 2026 16:47124,2511,042,700,9751,029,284,0002,006,0002,113,536
7May 25, 2026 16:47124,3641,043,369,6961,031,156,0001,066,0002,113,536
8May 25, 2026 16:47124,3641,043,312,5201,031,162,0001,067,0002,113,536
9May 25, 2026 16:47124,3761,044,095,3591,031,182,0001,142,0002,113,536