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:45Josu San MartinJosu San MartinScore: 27,167Success
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:4627,149141,520,732131,781,0001,250,0002,113,536
2Aug 4, 2026 02:4627,151141,544,222132,022,0001,020,0002,113,536
3Aug 4, 2026 02:4627,160141,502,304131,827,0001,260,0002,113,536
4Aug 4, 2026 02:4627,163141,552,759132,072,0001,028,0002,113,536
5Aug 4, 2026 02:4627,167141,512,438131,843,0001,280,0002,113,536
6Aug 4, 2026 02:4627,179142,291,301131,907,0001,271,0002,113,536
7Aug 4, 2026 02:4627,187141,792,372131,961,0001,256,0002,113,536
8Aug 4, 2026 02:4627,227143,189,257132,146,0001,267,0002,113,536
9Aug 4, 2026 02:4627,284142,932,602132,436,0001,258,0002,113,536