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 10, 2026 16:19Alexander FrolovAlexander FrolovScore: 65,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 16:1965,046559,581,973538,880,000999,0002,273,280
2Jan 10, 2026 16:1965,128569,386,516538,563,0001,998,0002,277,376
3Jan 10, 2026 16:1965,130573,428,000538,583,0001,998,0002,277,376