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 2, 2026 19:46anboto1anboto1Score: 61,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 19:4761,805312,762,070301,734,0001,113,0002,113,536
2Aug 2, 2026 19:4761,807312,977,241301,756,0001,101,0002,113,536
3Aug 2, 2026 19:4761,816312,953,251301,789,0001,113,0002,113,536
4Aug 2, 2026 19:4761,837313,125,900301,866,0001,137,0002,113,536
5Aug 2, 2026 19:4761,894313,316,814302,155,0001,126,0002,113,536
6Aug 2, 2026 19:4761,903313,314,389302,201,0001,125,0002,113,536
7Aug 2, 2026 19:4761,933313,550,551302,352,0001,121,0002,113,536
8Aug 2, 2026 19:4762,070314,113,625303,042,0001,101,0002,113,536
9Aug 2, 2026 19:4763,042319,699,057307,784,0001,124,0002,113,536