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:40Josu San MartinJosu San MartinScore: 28,833Success
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:4028,793150,116,391139,825,0001,261,0002,113,536
2Aug 3, 2026 02:4028,793150,111,905139,818,0001,270,0002,113,536
3Aug 3, 2026 02:4028,806149,712,015140,129,0001,022,0002,113,536
4Aug 3, 2026 02:4028,810149,630,609139,895,0001,278,0002,113,536
5Aug 3, 2026 02:4028,833150,401,687140,012,0001,273,0002,113,536
6Aug 3, 2026 02:4028,843149,767,601140,061,0001,271,0002,113,536
7Aug 3, 2026 02:4029,085150,949,345141,246,0001,272,0002,113,536
8Aug 3, 2026 02:4029,103151,666,190141,357,0001,249,0002,113,536
9Aug 3, 2026 02:4029,229151,604,878141,971,0001,255,0002,113,536