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 listJan 22, 2026 04:06Josu San MartinJosu San MartinScore: 113,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2026 04:06113,672579,771,028552,996,0003,999,0002,269,184
2Jan 22, 2026 04:06113,726578,868,111557,258,00002,269,184
3Jan 22, 2026 04:06113,750591,051,944556,378,000998,0002,269,184
4Jan 22, 2026 04:06113,758583,057,432552,422,0004,994,0002,363,392
5Jan 22, 2026 04:06113,763597,306,886556,442,000998,0002,269,184
6Jan 22, 2026 04:06113,885580,970,108557,035,0001,000,0002,269,184
7Jan 22, 2026 04:06114,198586,555,856557,571,0001,998,0002,371,584
8Jan 22, 2026 04:06114,361590,113,832559,369,0001,000,0002,269,184
9Jan 22, 2026 04:06114,500585,535,344559,048,0002,000,0002,269,184