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 7, 2026 13:19Pavel SkripkinPavel SkripkinScore: 80,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 13:1980,510702,450,217433,503,000234,731,0002,367,488
2Jan 7, 2026 13:1980,988697,274,582433,483,000238,715,0002,289,664
3Jan 7, 2026 13:1981,514705,600,396433,724,000242,845,0002,355,200