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 listApr 17, 2026 12:37wnwnScore: 11,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 12:3711,843123,237,53097,296,0001,003,0002,273,280
2Apr 17, 2026 12:3711,994125,749,12699,548,00002,293,760
3Apr 17, 2026 12:3712,700132,432,958103,422,0001,988,0002,293,760