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 25, 2025 17:34Mikhail ShirokovMikhail ShirokovScore: 53,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 17:3453,311472,334,123441,478,0001,001,0002,531,328
2Jan 25, 2025 17:3453,333468,190,302440,668,0001,998,0002,437,120
3Jan 25, 2025 17:3453,337472,391,126441,701,000999,0002,445,312