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 20:33anboto1anboto1Score: 57,892Success
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 20:3557,641291,006,112281,386,0001,059,0002,113,536
2Aug 3, 2026 20:3557,656290,924,486281,379,0001,139,0002,113,536
3Aug 3, 2026 20:3557,752291,409,351281,877,0001,111,0002,113,536
4Aug 3, 2026 20:3557,761292,812,535281,820,0001,210,0002,113,536
5Aug 3, 2026 20:3557,892292,792,681282,556,0001,116,0002,113,536
6Aug 3, 2026 20:3558,774296,454,855286,876,0001,118,0002,113,536
7Aug 3, 2026 20:3559,258298,763,133289,112,0001,255,0002,113,536
8Aug 3, 2026 20:3559,299298,990,666289,410,0001,157,0002,113,536
9Aug 3, 2026 20:3559,307299,108,671289,462,0001,143,0002,113,536