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 30, 2026 14:21Victor MerckléVictor MerckléScore: 53,344Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:2253,210268,399,272258,627,0002,105,0002,117,632stderr
2Jun 30, 2026 14:2253,224268,536,623258,668,0002,132,0002,117,632stderr
3Jun 30, 2026 14:2253,245268,863,931258,762,0002,143,0002,117,632stderr
4Jun 30, 2026 14:2253,254268,619,290258,790,0002,155,0002,117,632stderr
5Jun 30, 2026 14:2253,344269,025,394259,309,0002,080,0002,117,632stderr
6Jun 30, 2026 14:2253,391269,255,345259,480,0002,140,0002,117,632stderr
7Jun 30, 2026 14:2253,451269,770,315259,785,0002,126,0002,117,632stderr
8Jun 30, 2026 14:2253,812271,602,761261,604,0002,078,0002,117,632stderr
9Jun 30, 2026 14:2253,828271,457,977261,600,0002,162,0002,117,632stderr