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 20:49Josu San MartinJosu San MartinScore: 27,595Success
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 20:4927,566144,164,628133,819,0001,256,0002,113,536
2Aug 4, 2026 20:4927,590144,322,652133,934,0001,258,0002,113,536
3Aug 4, 2026 20:4927,593144,247,087133,954,0001,255,0002,113,536
4Aug 4, 2026 20:4927,595143,729,958133,961,0001,255,0002,113,536
5Aug 4, 2026 20:4927,595144,297,870133,952,0001,264,0002,113,536
6Aug 4, 2026 20:4927,596144,245,093133,950,0001,271,0002,113,536
7Aug 4, 2026 20:4927,603144,235,466134,006,0001,252,0002,113,536
8Aug 4, 2026 20:4927,628144,453,789134,118,0001,262,0002,113,536
9Aug 4, 2026 20:4927,844145,492,574135,432,0001,005,0002,113,536