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 4, 2026 15:14Josu San MartinJosu San MartinScore: 25,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 15:1425,073131,871,799121,595,0001,264,0002,113,536
2Aug 4, 2026 15:1425,105131,413,656121,760,0001,257,0002,113,536
3Aug 4, 2026 15:1425,194132,452,404122,190,0001,265,0002,113,536
4Aug 4, 2026 15:1425,198132,553,916122,200,0001,274,0002,113,536
5Aug 4, 2026 15:1425,205131,876,441122,338,0001,171,0002,113,536
6Aug 4, 2026 15:1425,206132,027,154122,481,0001,031,0002,113,536
7Aug 4, 2026 15:1425,211132,513,631122,490,0001,048,0002,113,536
8Aug 4, 2026 15:1425,218132,101,313122,566,0001,006,0002,113,536
9Aug 4, 2026 15:1425,578133,779,898124,057,0001,279,0002,113,536