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 2, 2026 23:25Josu San MartinJosu San MartinScore: 29,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 23:2529,444153,365,271143,191,0001,085,0002,117,632
2Aug 2, 2026 23:2529,449152,804,495143,212,0001,090,0002,117,632
3Aug 2, 2026 23:2529,454153,376,718143,248,0001,080,0002,117,632
4Aug 2, 2026 23:2529,476152,817,699143,352,0001,083,0002,117,632
5Aug 2, 2026 23:2529,480152,908,373143,346,0001,106,0002,117,632
6Aug 2, 2026 23:2529,491152,957,247143,419,0001,089,0002,117,632
7Aug 2, 2026 23:2529,504152,910,085143,476,0001,096,0002,117,632
8Aug 2, 2026 23:2529,596153,664,966143,935,0001,088,0002,117,632
9Aug 2, 2026 23:2529,755154,200,134144,706,0001,098,0002,117,632