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 listJan 19, 2025 14:49MatthiasMatthiasScore: 290,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 14:49290,6601,449,466,9281,422,234,0001,998,0002,265,088
2Jan 19, 2025 14:49290,6781,448,686,9741,421,324,0002,998,0002,519,040
3Jan 19, 2025 14:49290,7021,448,609,0721,421,442,0002,998,0002,281,472
4Jan 19, 2025 14:49290,7051,449,303,7561,421,455,0002,998,0002,277,376
5Jan 19, 2025 14:49290,7471,455,575,7561,422,664,0001,998,0002,281,472
6Jan 19, 2025 14:49291,2551,455,741,4861,424,150,0002,998,0002,277,376
7Jan 19, 2025 14:49291,2731,462,756,3711,424,240,0002,998,0002,269,184
8Jan 19, 2025 14:49291,9191,464,828,2321,428,402,0001,999,0002,281,472
9Jan 19, 2025 14:49292,0821,458,667,2161,427,206,0003,997,0002,277,376