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 listAug 28, 2026 19:08Josu San MartinJosu San MartinScore: 25,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:0825,075131,939,971121,616,0001,255,0002,113,536
2Aug 28, 2026 19:0825,088131,310,561121,683,0001,249,0002,113,536
3Aug 28, 2026 19:0825,091131,345,536121,692,0001,258,0002,113,536
4Aug 28, 2026 19:0825,139131,632,639121,918,0001,266,0002,113,536
5Aug 28, 2026 19:0825,156132,262,189122,018,0001,248,0002,113,536
6Aug 28, 2026 19:0825,162131,712,897122,044,0001,252,0002,113,536
7Aug 28, 2026 19:0825,165131,735,057122,053,0001,259,0002,113,536
8Aug 28, 2026 19:0825,209131,915,111122,278,0001,250,0002,113,536
9Aug 28, 2026 19:0827,533143,335,782133,657,0001,259,0002,113,536