Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 16, 2026 02:50Victor MerckléVictor MerckléScore: 7,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 02:507,02065,617,48857,235,0001,039,0002,113,536
2May 16, 2026 02:507,02166,341,45557,234,0001,047,0002,113,536
3May 16, 2026 02:507,02367,918,79557,250,0001,047,0002,113,536
4May 16, 2026 02:507,02665,654,90158,318,00002,113,536
5May 16, 2026 02:507,02766,002,11057,320,0001,006,0002,113,536
6May 16, 2026 02:507,03469,086,41257,372,0001,018,0002,113,536
7May 16, 2026 02:507,08067,212,85858,772,00002,113,536
8May 16, 2026 02:507,09768,637,76857,817,0001,091,0002,113,536
9May 16, 2026 02:507,18969,042,14658,622,0001,047,0002,113,536