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 8, 2026 10:43Victor MerckléVictor MerckléScore: 51,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 10:4451,869263,300,757252,145,0002,014,0002,113,536
2Jun 8, 2026 10:4451,925263,677,965252,261,0002,176,0002,113,536
3Jun 8, 2026 10:4451,957265,179,075252,499,0002,092,0002,113,536
4Jun 8, 2026 10:4451,965263,724,933252,598,0002,032,0002,113,536
5Jun 8, 2026 10:4451,991264,025,037252,698,0002,058,0002,113,536
6Jun 8, 2026 10:4451,995263,989,612252,615,0002,164,0002,113,536
7Jun 8, 2026 10:4452,007263,960,866252,828,0002,008,0002,113,536
8Jun 8, 2026 10:4452,061264,216,440253,089,0002,010,0002,113,536
9Jun 8, 2026 10:4452,122264,585,029253,208,0002,194,0002,113,536