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 29, 2026 08:41Adam FolwarcznyAdam FolwarcznyScore: 11,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 08:4111,515106,234,99394,417,0001,160,0002,113,536
2Jun 29, 2026 08:4111,562105,268,80194,818,0001,149,0002,113,536
3Jun 29, 2026 08:4111,645105,931,20095,510,0001,148,0002,113,536
4Jun 29, 2026 08:4111,747107,058,27996,372,0001,131,0002,113,536
5Jun 29, 2026 08:4111,752106,909,50296,540,0001,003,0002,113,536
6Jun 29, 2026 08:4111,753106,897,84596,402,0001,150,0002,113,536
7Jun 29, 2026 08:4111,758106,940,42396,443,0001,154,0002,113,536
8Jun 29, 2026 08:4111,760106,986,05496,453,0001,155,0002,113,536
9Jun 29, 2026 08:4111,776107,002,99596,583,0001,160,0002,113,536