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 13:06Josu San MartinJosu San MartinScore: 25,457Success
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 13:0725,417133,606,038123,288,0001,256,0002,113,536
2Aug 4, 2026 13:0725,427133,604,652123,594,0001,003,0002,113,536
3Aug 4, 2026 13:0725,428133,708,312123,335,0001,264,0002,113,536
4Aug 4, 2026 13:0725,430133,628,556123,346,0001,264,0002,113,536
5Aug 4, 2026 13:0725,457133,837,321123,480,0001,262,0002,113,536
6Aug 4, 2026 13:0725,465133,842,142123,517,0001,265,0002,113,536
7Aug 4, 2026 13:0725,492133,992,208123,662,0001,252,0002,113,536
8Aug 4, 2026 13:0725,960136,188,933125,945,0001,259,0002,113,536
9Aug 4, 2026 13:0726,421138,553,993128,426,0001,038,0002,113,536