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 23:12Josu San MartinJosu San MartinScore: 30,088Success
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 23:1230,068157,316,359146,232,0001,103,0002,113,536
2Aug 2, 2026 23:1230,070157,387,814146,237,0001,106,0002,113,536
3Aug 2, 2026 23:1230,070158,134,442146,226,0001,118,0002,113,536
4Aug 2, 2026 23:1230,078158,147,486146,255,0001,129,0002,113,536
5Aug 2, 2026 23:1230,088157,456,130146,320,0001,113,0002,113,536
6Aug 2, 2026 23:1230,096157,494,390146,362,0001,112,0002,113,536
7Aug 2, 2026 23:1230,098158,221,262146,355,0001,129,0002,113,536
8Aug 2, 2026 23:1230,313159,385,212147,415,0001,123,0002,113,536
9Aug 2, 2026 23:1230,338158,696,062147,553,0001,108,0002,113,536