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 listJul 9, 2026 22:15Victor MerckléVictor MerckléScore: 31,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 22:1631,012159,866,876150,953,0001,009,0002,117,632stderr
2Jul 9, 2026 22:1631,059160,076,265151,181,0001,009,0002,117,632stderr
3Jul 9, 2026 22:1631,107160,313,949150,415,0002,012,0002,117,632stderr
4Jul 9, 2026 22:1631,136160,457,995151,561,0001,008,0002,117,632stderr
5Jul 9, 2026 22:1631,180160,849,704151,774,0001,009,0002,117,632stderr
6Jul 9, 2026 22:1631,218160,848,556151,963,0001,008,0002,117,632stderr
7Jul 9, 2026 22:1631,273161,179,329152,231,0001,010,0002,117,632stderr
8Jul 9, 2026 22:1631,509162,476,538153,386,0001,011,0002,117,632stderr
9Jul 9, 2026 22:1631,553162,679,074152,605,0002,006,0002,117,632stderr