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:21matsuoka-601matsuoka-601Score: 22,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:2122,530215,804,605184,001,0003,000,0002,318,336
2Jan 2, 2025 08:2122,533213,113,852185,022,0002,000,0002,318,336
3Jan 2, 2025 08:2122,847219,289,046184,639,0004,990,0002,318,336