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 02:14Josu San MartinJosu San MartinScore: 28,943Success
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 02:1528,886150,044,377140,281,0001,261,0002,113,536
2Aug 4, 2026 02:1528,906150,792,531140,385,0001,256,0002,113,536
3Aug 4, 2026 02:1528,911150,708,687140,397,0001,267,0002,113,536
4Aug 4, 2026 02:1528,919150,861,545140,702,0001,004,0002,113,536
5Aug 4, 2026 02:1528,943150,974,837140,553,0001,270,0002,113,536
6Aug 4, 2026 02:1528,943150,895,202140,557,0001,265,0002,113,536
7Aug 4, 2026 02:1528,948150,948,484140,583,0001,263,0002,113,536
8Aug 4, 2026 02:1529,442153,286,308143,014,0001,256,0002,117,632
9Aug 4, 2026 02:1529,759156,342,349144,550,0001,273,0002,113,536