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 18:46Mikhail ShirokovMikhail ShirokovScore: 45,507Success
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 18:4645,466398,139,219376,370,0001,000,0002,531,328
2Jan 25, 2025 18:4645,490408,284,584375,574,0001,997,0002,269,184
3Jan 25, 2025 18:4645,503402,772,429375,676,0001,998,0002,449,408
4Jan 25, 2025 18:4645,503398,868,086375,678,0001,998,0002,531,328
5Jan 25, 2025 18:4645,507405,169,284375,712,0001,998,0002,531,328
6Jan 25, 2025 18:4645,527407,380,044375,877,0001,999,0002,269,184
7Jan 25, 2025 18:4645,530405,248,088375,898,0001,999,0002,269,184
8Jan 25, 2025 18:4645,544404,669,760376,014,0002,000,0002,449,408
9Jan 25, 2025 18:4645,586403,643,576377,362,0001,000,0002,449,408