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 16:24Josu San MartinJosu San MartinScore: 29,767Success
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 16:2529,745155,751,043144,658,0001,097,0002,113,536
2Aug 2, 2026 16:2529,756155,827,181144,644,0001,162,0002,113,536
3Aug 2, 2026 16:2529,765155,907,162144,726,0001,123,0002,113,536
4Aug 2, 2026 16:2529,766156,610,647144,713,0001,145,0002,113,536
5Aug 2, 2026 16:2529,767156,348,598144,721,0001,141,0002,113,536
6Aug 2, 2026 16:2529,767155,839,548144,737,0001,122,0002,113,536
7Aug 2, 2026 16:2529,770155,872,075144,742,0001,132,0002,113,536
8Aug 2, 2026 16:2529,825157,459,982145,014,0001,132,0002,113,536
9Aug 2, 2026 16:2530,054157,285,208146,132,0001,136,0002,113,536