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 listJun 19, 2026 03:47Victor MerckléVictor MerckléScore: 57,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 03:4857,305288,405,592278,692,0002,104,0002,113,536
2Jun 19, 2026 03:4857,316288,441,610278,709,0002,142,0002,113,536
3Jun 19, 2026 03:4857,319288,483,661278,742,0002,122,0002,113,536
4Jun 19, 2026 03:4857,326288,785,481278,888,0002,013,0002,113,536
5Jun 19, 2026 03:4857,365288,714,776278,893,0002,200,0002,113,536
6Jun 19, 2026 03:4857,522289,860,217279,699,0002,159,0002,113,536
7Jun 19, 2026 03:4857,616289,953,600280,297,0002,025,0002,113,536
8Jun 19, 2026 03:4857,616289,912,101280,152,0002,167,0002,113,536
9Jun 19, 2026 03:4858,481294,190,638284,426,0002,134,0002,113,536