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 29, 2025 11:07NoSIMD_C#NoSIMD_C#Score: 56,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2025 11:0756,394492,080,312466,068,0002,000,0002,289,664
2Jan 29, 2025 11:0756,400491,036,046467,123,0001,000,0002,289,664
3Jan 29, 2025 11:0756,413496,114,512467,231,0001,000,0002,289,664
4Jan 29, 2025 11:0756,414494,884,102467,238,0001,000,0002,289,664
5Jan 29, 2025 11:0756,421494,078,644466,297,0002,001,0002,269,184
6Jan 29, 2025 11:0756,422492,109,929467,305,0001,000,0002,293,760
7Jan 29, 2025 11:0756,435496,988,246467,410,0001,000,0002,265,088
8Jan 29, 2025 11:0756,437498,487,362467,424,0001,000,0002,269,184
9Jan 29, 2025 11:0756,523496,949,911468,137,0001,000,0002,281,472