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 listJan 24, 2026 16:06Alexander FrolovAlexander FrolovScore: 165,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 24, 2026 16:06165,2271,393,952,9521,369,385,0001,999,0002,486,272
2Jan 24, 2026 16:06165,2281,394,776,1071,369,393,0001,999,0002,277,376
3Jan 24, 2026 16:06165,3151,397,685,1531,370,118,0001,998,0002,482,176