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 13, 2025 16:32Advait IyerAdvait IyerScore: 57,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2025 16:3257,443506,757,120474,776,0001,999,0002,289,664
2Jan 13, 2025 16:3257,444507,242,318475,785,000999,0002,269,184
3Jan 13, 2025 16:3257,455499,999,945474,878,0001,999,0002,273,280
4Jan 13, 2025 16:3257,468501,910,321474,988,0001,999,0002,265,088
5Jan 13, 2025 16:3257,475505,573,922475,046,0002,000,0002,269,184
6Jan 13, 2025 16:3257,478505,541,726475,066,0002,000,0002,265,088
7Jan 13, 2025 16:3257,490506,718,394476,167,0001,000,0002,289,664
8Jan 13, 2025 16:3257,491506,301,309475,177,0002,000,0002,265,088
9Jan 13, 2025 16:3257,504499,957,896477,283,00002,281,472