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 listOct 27, 2025 04:44Tan Lip WeiTan Lip WeiScore: 30,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 04:4430,791281,875,643255,565,00002,519,040
2Oct 27, 2025 04:4430,797281,062,994255,617,00002,265,088
3Oct 27, 2025 04:4430,803280,387,318254,667,000998,0002,523,136
4Oct 27, 2025 04:4430,805276,286,391253,681,0001,997,0002,285,568
5Oct 27, 2025 04:4430,805280,750,826253,683,0001,997,0002,519,040
6Oct 27, 2025 04:4430,809283,272,066253,717,0001,997,0002,265,088
7Oct 27, 2025 04:4430,817282,688,758253,784,0001,998,0002,269,184
8Oct 27, 2025 04:4430,841282,591,161253,979,0001,999,0002,269,184
9Oct 27, 2025 04:4430,845281,166,227255,017,0001,000,0002,285,568