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 10:36Josu San MartinJosu San MartinScore: 29,003Success
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 10:3628,981151,086,560140,738,0001,272,0002,113,536
2Aug 3, 2026 10:3628,992151,153,205141,057,0001,008,0002,113,536
3Aug 3, 2026 10:3628,993150,542,518140,795,0001,271,0002,113,536
4Aug 3, 2026 10:3628,993150,525,248140,807,0001,262,0002,113,536
5Aug 3, 2026 10:3629,003150,668,171141,106,0001,010,0002,113,536
6Aug 3, 2026 10:3629,003150,691,957140,848,0001,270,0002,113,536
7Aug 3, 2026 10:3629,034151,246,621141,249,0001,018,0002,113,536
8Aug 3, 2026 10:3629,277152,008,283142,439,0001,019,0002,113,536
9Aug 3, 2026 10:3629,423153,211,274143,152,0001,022,0002,113,536