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 listMay 11, 2026 10:19wnwnScore: 99,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 10:2098,806494,448,392482,109,0002,045,0002,113,536
2May 11, 2026 10:2098,813493,610,838482,100,0002,085,0002,113,536
3May 11, 2026 10:2098,869495,323,508482,398,0002,062,0002,113,536
4May 11, 2026 10:2098,940494,038,542482,805,0002,004,0002,113,536
5May 11, 2026 10:2099,376496,372,775484,927,0002,018,0002,113,536
6May 11, 2026 10:2099,381497,052,710484,929,0002,038,0002,113,536
7May 11, 2026 10:2099,407495,877,908485,062,0002,036,0002,113,536
8May 11, 2026 10:2099,445496,026,485485,277,0002,006,0002,113,536
9May 11, 2026 10:2099,511496,275,858485,574,0002,034,0002,113,536