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 listMay 18, 2026 01:15M-RochatM-RochatScore: 119,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:15118,578592,431,098579,897,0001,136,0002,113,536
2May 18, 2026 01:15118,607591,341,127580,052,0001,127,0002,113,536
3May 18, 2026 01:15118,721593,126,781580,601,0001,134,0002,113,536
4May 18, 2026 01:15118,997594,091,034581,941,0001,146,0002,113,536
5May 18, 2026 01:15119,210594,137,177582,989,0001,141,0002,113,536
6May 18, 2026 01:15122,730611,449,189600,230,0001,151,0002,113,536
7May 18, 2026 01:15122,746612,499,194600,312,0001,148,0002,113,536
8May 18, 2026 01:15123,711617,255,321605,043,0001,142,0002,113,536
9May 18, 2026 01:15123,773617,002,058605,370,0001,122,0002,113,536