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:03MatthiasMatthiasScore: 519,656Success
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:03519,5472,576,704,4912,541,784,0003,998,0002,281,472
2Jan 19, 2025 14:03519,5752,574,091,9372,544,919,000999,0002,277,376
3Jan 19, 2025 14:03519,5812,571,156,6412,542,951,0002,997,0002,281,472
4Jan 19, 2025 14:03519,6392,571,512,1172,544,231,0001,999,0002,277,376
5Jan 19, 2025 14:03519,6562,578,024,1922,543,318,0002,998,0002,273,280
6Jan 19, 2025 14:03519,6702,571,059,2782,543,384,0002,998,0002,281,472
7Jan 19, 2025 14:03519,7292,575,772,4602,544,672,0001,998,0002,281,472
8Jan 19, 2025 14:03519,8172,573,075,7032,545,105,0001,998,0002,281,472
9Jan 19, 2025 14:03521,7452,589,038,1622,554,551,0001,998,0002,519,040