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 27, 2026 13:38Kevin HeaveyKevin HeaveyScore: 53,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 13:5453,011269,875,466249,854,0009,901,00020,480
2Jul 27, 2026 13:5453,040269,948,451250,058,0009,838,00020,480
3Jul 27, 2026 13:5453,137270,449,443249,071,00011,302,00020,480
4Jul 27, 2026 13:5453,181276,390,923249,175,00011,413,00020,480
5Jul 27, 2026 13:5453,190271,349,452250,076,00010,557,00020,480
6Jul 27, 2026 13:5453,262271,015,584248,977,00012,009,00020,480
7Jul 27, 2026 13:5453,274271,191,654249,087,00011,960,00020,480
8Jul 27, 2026 13:5453,361271,591,172249,352,00012,118,00020,480
9Jul 27, 2026 13:5453,408272,051,689249,340,00012,363,00020,480