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 listJul 31, 2026 21:40anboto1anboto1Score: 135,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 21:40135,056672,654,975660,382,0001,394,0002,113,536
2Jul 31, 2026 21:40135,123672,140,518660,744,0001,361,0002,113,536
3Jul 31, 2026 21:40135,170672,579,671660,982,0001,353,0002,113,536
4Jul 31, 2026 21:40135,770675,566,415663,901,0001,375,0002,113,536
5Jul 31, 2026 21:40135,973676,408,445664,918,0001,352,0002,113,536
6Jul 31, 2026 21:40136,586679,408,213667,895,0001,378,0002,113,536
7Jul 31, 2026 21:40136,746680,243,363668,690,0001,368,0002,113,536
8Jul 31, 2026 21:40136,747680,229,529668,702,0001,362,0002,113,536
9Jul 31, 2026 21:40138,337688,130,750676,482,0001,370,0002,113,536