Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listJul 19, 2026 10:49Andrew TsibinAndrew TsibinScore: 69,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 10:4969,809351,818,517340,716,0001,350,00020,480
2Jul 19, 2026 10:4969,833351,896,501341,065,0001,119,00020,480
3Jul 19, 2026 10:4969,834351,974,045340,732,0001,459,00020,480
4Jul 19, 2026 10:4969,881352,251,754340,792,0001,625,00020,480
5Jul 19, 2026 10:4969,887352,768,604340,864,0001,585,00020,480
6Jul 19, 2026 10:4969,894352,236,820340,899,0001,582,00020,480
7Jul 19, 2026 10:4969,954352,425,169341,063,0001,713,00020,480
8Jul 19, 2026 10:4971,232358,808,925347,493,0001,548,00020,480
9Jul 19, 2026 10:4971,300359,221,427347,568,0001,805,00020,480