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 2, 2025 08:52matsuoka-601matsuoka-601Score: 32,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2025 08:5232,533298,692,229268,027,0002,000,0002,301,952
2Jan 2, 2025 08:5232,533297,672,230267,027,0003,000,0002,322,432
3Jan 2, 2025 08:5232,539297,290,193266,074,0004,001,0002,318,336