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 16:42Josu San MartinJosu San MartinScore: 25,194Success
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 16:4325,164131,713,940122,060,0001,247,0002,113,536
2Aug 4, 2026 16:4325,168131,758,662122,060,0001,264,0002,113,536
3Aug 4, 2026 16:4325,175132,435,840122,097,0001,263,0002,113,536
4Aug 4, 2026 16:4325,179132,416,752122,114,0001,266,0002,113,536
5Aug 4, 2026 16:4325,194132,515,240122,208,0001,247,0002,113,536
6Aug 4, 2026 16:4325,224131,992,076122,333,0001,265,0002,113,536
7Aug 4, 2026 16:4325,449133,076,556123,436,0001,268,0002,113,536
8Aug 4, 2026 16:4326,907141,426,435130,593,0001,256,0002,113,536
9Aug 4, 2026 16:4330,221157,088,930146,823,0001,262,0002,113,536