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 listFeb 24, 2026 16:44spatialspatialScore: 75,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 16:4475,271651,706,855564,771,00059,975,0002,306,048
2Feb 24, 2026 16:4475,434649,782,143569,093,00057,009,0002,301,952
3Feb 24, 2026 16:4475,551653,015,477570,066,00057,006,0002,404,352