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 14:25Kevin HeaveyKevin HeaveyScore: 65,986Success
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 14:5965,348330,167,760311,743,0008,464,00020,480
2Jul 27, 2026 14:5965,590331,504,855312,275,0009,117,00020,480
3Jul 27, 2026 14:5965,715332,129,970312,839,0009,167,00020,480
4Jul 27, 2026 14:5965,897334,278,210311,603,00011,296,00020,480
5Jul 27, 2026 14:5965,986333,460,713311,615,00011,720,00020,480
6Jul 27, 2026 14:5966,001334,252,810312,297,00011,112,0002,113,536
7Jul 27, 2026 14:5966,092333,921,461312,486,00011,368,00020,480
8Jul 27, 2026 14:5966,240334,697,247312,339,00012,241,0002,113,536
9Jul 27, 2026 14:5968,191345,033,721325,238,0008,901,0002,113,536