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 listOct 11, 2025 04:35Marco BarboneMarco BarboneScore: 28,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 04:3528,807262,567,723237,099,0002,000,0002,519,040
2Oct 11, 2025 04:3528,812262,746,761237,137,0002,001,0002,289,664
3Oct 11, 2025 04:3528,816266,033,958237,173,0002,001,0002,289,664