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 1, 2026 09:54Josu San MartinJosu San MartinScore: 37,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 09:5537,064191,632,672180,503,0001,113,0002,113,536
2Aug 1, 2026 09:5537,068191,677,017180,517,0001,118,0002,113,536
3Aug 1, 2026 09:5537,070192,568,332180,517,0001,130,0002,113,536
4Aug 1, 2026 09:5537,076192,567,191180,529,0001,146,0002,113,536
5Aug 1, 2026 09:5537,078192,545,670180,553,0001,130,0002,113,536
6Aug 1, 2026 09:5537,092192,363,778180,617,0001,138,0002,113,536
7Aug 1, 2026 09:5538,387198,159,478186,971,0001,126,0002,113,536
8Aug 1, 2026 09:5538,395198,328,184187,030,0001,107,0002,113,536
9Aug 1, 2026 09:5538,447199,290,451187,265,0001,127,0002,113,536