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:59wnwnScore: 98,441Success
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 11:0097,899490,366,214478,620,0001,089,0002,113,536
2May 11, 2026 11:0097,932489,500,688478,709,0001,161,0002,113,536
3May 11, 2026 11:0098,084501,485,582479,611,0001,001,0002,113,536
4May 11, 2026 11:0098,175490,572,741480,002,0001,057,0002,113,536
5May 11, 2026 11:0098,441492,787,720481,238,0001,127,0002,113,536
6May 11, 2026 11:0098,459491,194,240481,289,0001,161,0002,113,536
7May 11, 2026 11:0098,472493,159,717481,467,0001,050,0002,113,536
8May 11, 2026 11:0098,519493,490,872481,642,0001,104,0002,113,536
9May 11, 2026 11:0098,761492,757,935482,804,0001,128,0002,113,536