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 listAug 27, 2026 09:00Victor MerckléVictor MerckléScore: 20,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 09:0019,836173,673,167163,579,0001,066,0002,113,536
2Aug 27, 2026 09:0019,841172,996,767163,622,0001,066,0002,113,536
3Aug 27, 2026 09:0019,866173,222,685163,833,0001,059,0002,113,536
4Aug 27, 2026 09:0019,889173,310,049164,043,0001,036,0002,113,536
5Aug 27, 2026 09:0020,179175,820,538166,448,0001,045,0002,113,536
6Aug 27, 2026 09:0020,201176,052,865166,617,0001,057,0002,113,536
7Aug 27, 2026 09:0020,216176,152,398166,731,0001,069,0002,113,536
8Aug 27, 2026 09:0020,224176,190,244166,812,0001,050,0002,113,536
9Aug 27, 2026 09:0020,225176,202,073166,809,0001,065,0002,113,536