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 23, 2025 19:52Ian MckibbenIan MckibbenScore: 31,085Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 19:5231,055288,685,839256,757,000999,0002,510,848
2Jan 23, 2025 19:5231,057282,941,561256,772,000999,0002,428,928
3Jan 23, 2025 19:5231,057279,770,055256,772,000999,0002,428,928
4Jan 23, 2025 19:5231,073284,280,485256,907,000999,0002,437,120
5Jan 23, 2025 19:5231,085280,350,236256,004,0002,000,0002,531,328
6Jan 23, 2025 19:5231,089282,083,420257,039,0001,000,0002,269,184
7Jan 23, 2025 19:5231,106280,065,021258,177,00002,433,024
8Jan 23, 2025 19:5231,110280,358,139256,214,0002,001,0002,531,328
9Jan 23, 2025 19:5231,152285,653,152258,559,00002,428,928