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 05:01Josu San MartinJosu San MartinScore: 32,399Success
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 05:0232,367167,705,398157,333,0001,267,0002,113,536
2Aug 3, 2026 05:0232,367166,987,709157,322,0001,279,0002,113,536
3Aug 3, 2026 05:0232,383167,132,266157,408,0001,273,0002,113,536
4Aug 3, 2026 05:0232,387167,766,130157,420,0001,278,0002,113,536
5Aug 3, 2026 05:0232,399167,828,391157,502,0001,254,0002,113,536
6Aug 3, 2026 05:0232,423175,544,947157,862,0001,014,0002,113,536
7Aug 3, 2026 05:0232,450167,447,241157,996,0001,011,0002,113,536
8Aug 3, 2026 05:0232,496177,274,505158,184,0001,048,0002,113,536
9Aug 3, 2026 05:0232,515176,551,071158,299,0001,027,0002,113,536