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 listApr 27, 2026 18:37Victor MerckléVictor MerckléScore: 610,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 18:37610,4543,010,018,8542,987,232,0003,997,0002,506,752stderr
2Apr 27, 2026 18:37610,4703,017,989,4692,987,307,0003,997,0002,564,096stderr
3Apr 27, 2026 18:37612,5383,021,756,1722,998,440,0002,998,0002,502,656stderr