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 25, 2026 00:10Victor MerckléVictor MerckléScore: 28,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 00:1127,899146,132,376134,684,0002,024,0002,117,632stderr
2Aug 25, 2026 00:1127,938145,326,765135,889,0001,009,0002,117,632stderr
3Aug 25, 2026 00:1127,954145,498,030134,946,0002,030,0002,117,632stderr
4Aug 25, 2026 00:1127,979145,914,931135,073,0002,028,0002,117,632stderr
5Aug 25, 2026 00:1128,000145,604,967135,165,0002,037,0002,117,632stderr
6Aug 25, 2026 00:1128,017145,653,010135,243,0002,044,0002,117,632stderr
7Aug 25, 2026 00:1128,022145,681,323136,302,0001,009,0002,117,632stderr
8Aug 25, 2026 00:1128,055145,861,215135,380,0002,092,0002,117,632stderr
9Aug 25, 2026 00:1128,124146,269,338135,790,0002,021,0002,117,632stderr