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 3, 2026 17:42Josu San MartinJosu San MartinScore: 28,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 17:4328,225146,444,234137,060,0001,244,0002,113,536
2Aug 3, 2026 17:4328,225146,780,740137,303,0001,004,0002,113,536
3Aug 3, 2026 17:4328,226146,657,464137,045,0001,266,0002,113,536
4Aug 3, 2026 17:4328,241146,769,028137,132,0001,253,0002,113,536
5Aug 3, 2026 17:4328,254150,910,013137,176,0001,271,0002,117,632
6Aug 3, 2026 17:4328,261146,658,698137,201,0001,279,0002,113,536
7Aug 3, 2026 17:4328,264147,727,459137,218,0001,276,0002,113,536
8Aug 3, 2026 17:4328,269146,918,354137,253,0001,268,0002,113,536
9Aug 3, 2026 17:4328,286147,014,033137,332,0001,273,0002,113,536