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 20:53Josu San MartinJosu San MartinScore: 31,918Success
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 20:5431,789166,599,432154,644,0001,126,0002,113,536
2Aug 2, 2026 20:5431,802166,616,457154,694,0001,136,0002,113,536
3Aug 2, 2026 20:5431,827166,030,557154,792,0001,165,0002,113,536
4Aug 2, 2026 20:5431,876167,238,474155,074,0001,122,0002,113,536
5Aug 2, 2026 20:5431,918167,251,180155,252,0001,148,0002,113,536
6Aug 2, 2026 20:5431,990167,103,233155,612,0001,140,0002,113,536
7Aug 2, 2026 20:5435,073182,651,066170,733,0001,126,0002,113,536
8Aug 2, 2026 20:5440,195206,988,108195,822,0001,136,0002,113,536
9Aug 2, 2026 20:5442,044216,120,601204,902,0001,115,0002,113,536