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 4, 2026 05:07Josu San MartinJosu San MartinScore: 27,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 05:0827,936145,966,783135,617,0001,273,0002,113,536
2Aug 4, 2026 05:0827,950145,467,420135,687,0001,272,0002,113,536
3Aug 4, 2026 05:0827,954145,370,187135,962,0001,017,0002,113,536
4Aug 4, 2026 05:0827,961146,133,957135,733,0001,276,0002,113,536
5Aug 4, 2026 05:0827,974145,269,052136,058,0001,016,0002,113,536
6Aug 4, 2026 05:0827,992146,227,280135,893,0001,271,0002,113,536
7Aug 4, 2026 05:0828,022145,755,610136,055,0001,253,0002,113,536
8Aug 4, 2026 05:0828,025145,439,112136,051,0001,272,0002,113,536
9Aug 4, 2026 05:0828,058146,352,150136,223,0001,262,0002,113,536