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 14, 2026 06:49Victor MerckléVictor MerckléScore: 6,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 06:496,96266,714,23957,791,00002,113,536
2May 14, 2026 06:496,96366,888,05356,797,0001,001,0002,113,536
3May 14, 2026 06:496,96367,528,76157,798,00002,113,536
4May 14, 2026 06:496,96566,436,84756,804,0001,012,0002,113,536
5May 14, 2026 06:496,96667,069,33557,820,00002,113,536
6May 14, 2026 06:496,97066,553,65756,848,0001,008,0002,113,536
7May 14, 2026 06:496,97165,714,39657,860,00002,113,536
8May 14, 2026 06:496,99366,701,10157,029,0001,014,0002,113,536
9May 14, 2026 06:497,01765,483,93758,246,00002,113,536