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 15:05bendnbendnScore: 680,622Success
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 15:05679,3775,669,445,7645,634,831,0003,997,0002,289,664
2Jan 25, 2025 15:05680,6225,677,086,4495,646,167,0002,997,0002,285,568
3Jan 25, 2025 15:05681,4005,685,652,9215,653,626,0001,998,0002,289,664