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 18, 2026 12:06wnwnScore: 7,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 12:067,25885,037,05456,229,0004,016,0002,445,312
2Feb 18, 2026 12:067,33384,300,65058,872,0001,995,0002,510,848
3Feb 18, 2026 12:067,37788,151,69959,223,0002,007,0002,375,680