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 02:56Josu San MartinJosu San MartinScore: 28,855Success
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 02:5628,827150,399,117140,228,0001,026,0002,113,536
2Aug 3, 2026 02:5628,835149,706,232140,016,0001,276,0002,113,536
3Aug 3, 2026 02:5628,836150,350,311140,259,0001,042,0002,113,536
4Aug 3, 2026 02:5628,840150,349,907140,308,0001,011,0002,113,536
5Aug 3, 2026 02:5628,855149,805,324140,132,0001,261,0002,113,536
6Aug 3, 2026 02:5628,889150,606,973140,290,0001,270,0002,113,536
7Aug 3, 2026 02:5628,947150,322,476140,563,0001,280,0002,113,536
8Aug 3, 2026 02:5629,140151,948,202141,774,0001,013,0002,113,536
9Aug 3, 2026 02:5629,324152,778,207142,664,0001,027,0002,113,536