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 22, 2026 21:37SneedSneedScore: 54,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 21:3754,139476,521,508447,355,0002,001,0002,273,280
2Feb 22, 2026 21:3754,150477,463,674448,446,000998,0002,523,136
3Feb 22, 2026 21:3754,184475,719,264446,727,0002,998,0002,277,376