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 listAug 24, 2026 21:39Victor MerckléVictor MerckléScore: 49,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 21:3948,823247,627,395237,212,0002,025,0002,117,632stderr
2Aug 24, 2026 21:3948,860247,892,538237,351,0002,063,0002,117,632stderr
3Aug 24, 2026 21:3948,963248,286,510237,898,0002,023,0002,117,632stderr
4Aug 24, 2026 21:3948,994248,496,485238,027,0002,048,0002,117,632stderr
5Aug 24, 2026 21:3949,143249,192,686239,793,0001,009,0002,117,632stderr
6Aug 24, 2026 21:3949,280249,840,761239,454,0002,018,0002,117,632stderr
7Aug 24, 2026 21:3949,447251,344,915240,279,0002,015,0002,117,632stderr
8Aug 24, 2026 21:3949,536251,103,376240,702,0002,025,0002,117,632stderr
9Aug 24, 2026 21:3952,008263,281,563252,802,0002,038,0002,117,632stderr