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 14:38Josu San MartinJosu San MartinScore: 89,552Success
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 14:3989,505448,664,524436,440,0002,138,0002,113,536
2Jul 31, 2026 14:3989,528448,775,895436,554,0002,137,0002,117,632
3Jul 31, 2026 14:3989,538450,058,307436,537,0002,202,0002,113,536
4Jul 31, 2026 14:3989,542448,860,651436,488,0002,272,0002,113,536
5Jul 31, 2026 14:3989,552450,249,863436,799,0002,007,0002,113,536
6Jul 31, 2026 14:3989,569449,901,162436,881,0002,009,0002,113,536
7Jul 31, 2026 14:3989,613449,325,530437,098,0002,010,0002,113,536
8Jul 31, 2026 14:3989,716450,427,075437,361,0002,250,0002,113,536
9Jul 31, 2026 14:3990,281452,500,458440,167,0002,211,0002,113,536