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 15, 2026 17:55Tomislav TunkovicTomislav TunkovicScore: 31,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 17:5831,820164,438,424154,911,0001,011,00020,480
2Aug 15, 2026 17:5831,872164,721,001154,164,0002,009,00020,480
3Aug 15, 2026 17:5831,958165,732,522154,575,0002,024,00020,480
4Aug 15, 2026 17:5831,979165,250,771155,689,0001,012,00020,480
5Aug 15, 2026 17:5831,985165,778,326155,717,0001,011,00020,480
6Aug 15, 2026 17:5832,104165,771,386156,304,0001,010,00020,480
7Aug 15, 2026 17:5832,243167,195,276156,978,0001,013,00020,480
8Aug 15, 2026 17:5833,865175,084,615164,929,0001,012,00020,480
9Aug 15, 2026 17:5834,418177,094,519167,644,0001,008,00020,480