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 05:31Josu San MartinJosu San MartinScore: 31,730Success
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 05:3231,516162,949,401153,424,0001,006,0002,113,536
2Aug 4, 2026 05:3231,531162,931,735153,499,0001,007,0002,113,536
3Aug 4, 2026 05:3231,546164,485,372153,495,0001,083,0002,113,536
4Aug 4, 2026 05:3231,568163,101,210153,418,0001,270,0002,113,536
5Aug 4, 2026 05:3231,730164,161,458154,202,0001,278,0002,113,536
6Aug 4, 2026 05:3231,736163,931,610154,501,0001,010,0002,113,536
7Aug 4, 2026 05:3231,744163,744,936154,422,0001,127,0002,113,536
8Aug 4, 2026 05:3231,785164,133,329154,468,0001,279,0002,113,536
9Aug 4, 2026 05:3232,802169,175,329159,731,0001,003,0002,113,536