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 listSep 2, 2026 17:02CheckHarryCheckHarryScore: 6,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 17:036,555364,335,44253,282,0001,127,0002,113,536
2Sep 2, 2026 17:036,579364,525,60953,560,0001,049,0002,113,536
3Sep 2, 2026 17:036,581364,543,96253,446,0001,178,0002,113,536
4Sep 2, 2026 17:036,630366,135,90153,979,0001,051,0002,113,536
5Sep 2, 2026 17:036,635366,225,89953,997,0001,075,0002,113,536
6Sep 2, 2026 17:036,918367,457,96256,312,0001,114,0002,113,536
7Sep 2, 2026 17:037,761374,342,92463,342,0001,076,0002,113,536
8Sep 2, 2026 17:037,803374,720,56563,693,0001,078,0002,113,536
9Sep 2, 2026 17:037,809374,941,06763,744,0001,078,0002,117,632