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 listFeb 8, 2026 06:22Brian ChewBrian ChewScore: 44,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2026 06:2244,661397,860,172369,688,000999,0002,269,184
2Feb 8, 2026 06:2244,666400,168,740367,729,0002,997,0002,387,968
3Feb 8, 2026 06:2244,674398,889,933369,796,000999,0002,400,256
4Feb 8, 2026 06:2244,677396,865,716369,820,000999,0002,392,064
5Feb 8, 2026 06:2244,677399,648,956369,822,000999,0002,269,184
6Feb 8, 2026 06:2244,689396,498,345367,918,0002,999,0002,269,184
7Feb 8, 2026 06:2244,691404,216,473367,936,0002,999,0002,392,064
8Feb 8, 2026 06:2244,692400,668,725368,945,0001,999,0002,269,184
9Feb 8, 2026 06:2244,698398,558,722368,994,0001,999,0002,404,352