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 21:30Josu San MartinJosu San MartinScore: 29,698Success
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 21:3129,660156,106,945144,217,0001,118,0002,113,536
2Aug 2, 2026 21:3129,688156,311,965144,341,0001,135,0002,113,536
3Aug 2, 2026 21:3129,689156,310,382144,349,0001,128,0002,113,536
4Aug 2, 2026 21:3129,696155,558,355144,388,0001,123,0002,113,536
5Aug 2, 2026 21:3129,698155,492,180144,406,0001,118,0002,113,536
6Aug 2, 2026 21:3129,719157,277,018144,499,0001,127,0002,113,536
7Aug 2, 2026 21:3129,736164,392,865144,543,0001,167,0002,113,536
8Aug 2, 2026 21:3129,797156,600,393144,881,0001,128,0002,113,536
9Aug 2, 2026 21:3129,914158,015,033145,455,0001,124,0002,113,536