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 listNov 23, 2025 06:47RacRacScore: 450,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2025 06:47450,0112,234,621,4092,203,053,0001,999,0002,396,160
2Nov 23, 2025 06:47450,0492,232,811,0842,204,240,000999,0002,269,184
3Nov 23, 2025 06:47450,0822,237,277,3622,203,403,0001,998,0002,400,256
4Nov 23, 2025 06:47450,0832,234,880,5682,203,410,0001,998,0002,269,184
5Nov 23, 2025 06:47450,1142,233,740,5362,202,563,0002,998,0002,392,064
6Nov 23, 2025 06:47450,1622,231,961,3822,204,794,000999,0002,396,160
7Nov 23, 2025 06:47450,1762,235,218,5032,205,863,00002,269,184
8Nov 23, 2025 06:47450,1872,231,666,3512,204,919,000999,0002,269,184
9Nov 23, 2025 06:47450,2242,234,576,8722,202,102,0003,996,0002,400,256