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 21:38Tomislav TunkovicTomislav TunkovicScore: 29,898Success
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 21:3929,433152,681,686143,216,0001,008,00020,480
2Aug 15, 2026 21:3929,441153,184,631143,252,0001,010,00020,480
3Aug 15, 2026 21:3929,465152,920,974143,375,0001,008,00020,480
4Aug 15, 2026 21:3929,750154,266,390144,766,0001,009,00020,480
5Aug 15, 2026 21:3929,898154,971,659145,494,0001,010,00020,480
6Aug 15, 2026 21:3929,910155,060,135145,552,0001,009,00020,480
7Aug 15, 2026 21:3930,184156,390,805146,895,0001,010,00020,480
8Aug 15, 2026 21:3930,379157,295,768147,845,0001,014,00020,480
9Aug 15, 2026 21:3931,668164,322,742154,165,0001,009,00020,480