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 15:15Josu San MartinJosu San MartinScore: 33,202Success
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 15:1633,166172,622,304161,389,0001,128,0002,113,536
2Aug 1, 2026 15:1633,173172,635,034161,429,0001,120,0002,113,536
3Aug 1, 2026 15:1633,183173,457,463161,486,0001,113,0002,113,536
4Aug 1, 2026 15:1633,196173,766,852161,570,0001,092,0002,113,536
5Aug 1, 2026 15:1633,202173,347,553161,551,0001,142,0002,113,536
6Aug 1, 2026 15:1633,203173,221,162161,563,0001,133,0002,113,536
7Aug 1, 2026 15:1633,210173,555,904161,413,0001,317,0002,113,536
8Aug 1, 2026 15:1634,838180,860,441169,584,0001,125,0002,113,536
9Aug 1, 2026 15:1634,857181,725,779169,678,0001,126,0002,113,536