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 13:56Tomislav TunkovicTomislav TunkovicScore: 33,894Success
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 13:5833,462172,369,956162,834,0001,134,00020,480
2Aug 15, 2026 13:5833,468172,312,133162,836,0001,162,00020,480
3Aug 15, 2026 13:5833,500172,671,920162,997,0001,156,00020,480
4Aug 15, 2026 13:5833,891174,275,367164,937,0001,131,00020,480
5Aug 15, 2026 13:5833,894174,531,115164,953,0001,132,00020,480
6Aug 15, 2026 13:5833,968174,668,364165,378,0001,070,00020,480
7Aug 15, 2026 13:5834,176175,742,846166,407,0001,060,00020,480
8Aug 15, 2026 13:5834,482177,393,066167,815,0001,151,00020,480
9Aug 15, 2026 13:5834,866179,208,196169,697,0001,148,00020,480