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 20:18Josu San MartinJosu San MartinScore: 48,529Success
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 20:1847,845244,682,171233,333,0001,109,0002,113,536
2Jul 31, 2026 20:1847,855245,431,168233,354,0001,138,0002,113,536
3Jul 31, 2026 20:1847,875245,543,029233,467,0001,123,0002,113,536
4Jul 31, 2026 20:1847,888245,507,061233,517,0001,137,0002,113,536
5Jul 31, 2026 20:1848,529247,947,273236,668,0001,128,0002,113,536
6Jul 31, 2026 20:1848,548248,098,436236,773,0001,114,0002,113,536
7Jul 31, 2026 20:1848,569248,166,081236,862,0001,128,0002,113,536
8Jul 31, 2026 20:1848,827249,355,475238,134,0001,122,0002,113,536
9Jul 31, 2026 20:1852,122265,852,515254,258,0001,141,0002,113,536