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 29, 2025 02:03zielajzielajScore: 24,849Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2025 02:0324,834147,764,919120,692,000997,0002,301,952
2Jul 29, 2025 02:0324,842148,466,070119,729,0001,995,0002,314,240
3Jul 29, 2025 02:0324,845147,493,203120,742,000997,0002,465,792
4Jul 29, 2025 02:0324,847144,360,075119,754,0001,995,0002,334,720
5Jul 29, 2025 02:0324,849142,752,799118,765,0002,994,0002,318,336
6Jul 29, 2025 02:0324,849143,803,864120,764,000998,0002,363,392
7Jul 29, 2025 02:0324,850144,755,406120,765,000998,0002,318,336
8Jul 29, 2025 02:0325,479147,182,369122,851,0001,997,0002,334,720
9Jul 29, 2025 02:0326,735151,482,609129,001,0002,000,0002,281,472