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 3, 2026 01:15Josu San MartinJosu San MartinScore: 29,506Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 01:1629,481152,931,137143,190,0001,271,0002,113,536
2Aug 3, 2026 01:1629,485153,544,234143,223,0001,256,0002,113,536
3Aug 3, 2026 01:1629,487153,590,960143,211,0001,276,0002,113,536
4Aug 3, 2026 01:1629,503156,450,064143,287,0001,279,0002,113,536
5Aug 3, 2026 01:1629,506153,741,118143,308,0001,276,0002,113,536
6Aug 3, 2026 01:1629,536153,110,908143,467,0001,264,0002,113,536
7Aug 3, 2026 01:1629,539153,856,238143,726,0001,016,0002,113,536
8Aug 3, 2026 01:1629,628153,598,759143,921,0001,258,0002,113,536
9Aug 3, 2026 01:1629,888155,651,292145,439,0001,013,0002,113,536