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 20, 2025 14:43ttmxttmxScore: 31,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2025 14:4331,802291,901,991261,961,0001,999,0002,289,664
2Jan 20, 2025 14:4331,811292,656,461263,032,0001,000,0002,281,472
3Jan 20, 2025 14:4431,812289,256,300262,039,0002,000,0002,289,664
4Jan 20, 2025 14:4331,813291,465,022262,044,0002,000,0002,289,664
5Jan 20, 2025 14:4431,820289,458,538262,103,0002,000,0002,289,664
6Jan 20, 2025 14:4331,822286,659,336262,124,0002,000,0002,289,664
7Jan 20, 2025 14:4331,822293,309,837262,122,0002,000,0002,273,280
8Jan 20, 2025 14:4331,834291,114,722263,221,0001,000,0002,265,088
9Jan 20, 2025 14:4331,834290,624,155262,222,0002,001,0002,289,664
10Jan 20, 2025 14:4331,842287,519,826262,290,0002,002,0002,363,392
11Jan 20, 2025 14:4331,843287,296,538263,297,0001,001,0002,285,568
12Jan 20, 2025 14:4432,278301,223,541265,910,0001,999,0002,289,664