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 22, 2026 20:40M-RochatM-RochatScore: 112,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:41112,321562,631,645549,244,0001,132,0002,183,168
2May 22, 2026 20:41112,346560,432,621549,374,0001,126,0002,170,880
3May 22, 2026 20:41112,348561,156,768549,381,0001,129,0002,170,880
4May 22, 2026 20:41112,436561,710,296549,808,0001,131,0002,170,880
5May 22, 2026 20:41112,493561,151,480550,078,0001,139,0002,170,880
6May 22, 2026 20:41112,517563,919,898550,210,0001,125,0002,170,880
7May 22, 2026 20:41112,519564,146,470550,196,0001,150,0002,162,688
8May 22, 2026 20:41112,524566,043,735550,206,0001,162,0002,170,880
9May 22, 2026 20:41112,545563,965,821550,300,0001,171,0002,199,552