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:13bendnbendnScore: 679,747Success
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:13678,6165,661,079,0315,631,516,000999,0002,269,184
2Jan 25, 2025 15:13679,7475,674,846,5645,640,898,000999,0002,269,184
3Jan 25, 2025 15:13680,3235,674,563,8855,644,683,0001,998,0002,285,568