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 4, 2026 10:11Josu San MartinJosu San MartinScore: 26,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 10:1126,681139,957,715129,462,0001,275,0002,113,536
2Aug 4, 2026 10:1126,692139,250,545129,531,0001,261,0002,113,536
3Aug 4, 2026 10:1126,706139,303,354129,604,0001,258,0002,113,536
4Aug 4, 2026 10:1126,712139,970,176129,628,0001,261,0002,113,536
5Aug 4, 2026 10:1126,713139,352,678129,618,0001,276,0002,113,536
6Aug 4, 2026 10:1126,726139,449,757129,704,0001,254,0002,113,536
7Aug 4, 2026 10:1126,769139,656,596129,907,0001,264,0002,113,536
8Aug 4, 2026 10:1126,815140,500,175130,374,0001,023,0002,113,536
9Aug 4, 2026 10:1127,651144,656,220134,448,0001,046,0002,113,536