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 18, 2025 12:56Ashish AhujaAshish AhujaScore: 10,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 12:5610,857118,466,89086,111,0004,005,0002,359,296
2Aug 18, 2025 12:5610,883116,581,19685,315,0005,018,0002,285,568
3Aug 18, 2025 12:5610,889115,109,37485,413,0004,965,0002,314,240
4Aug 18, 2025 12:5610,905119,889,75784,545,0005,967,0002,342,912
5Aug 18, 2025 12:5610,942115,703,55384,834,0005,988,0002,277,376
6Aug 18, 2025 12:5610,961116,640,47085,978,0004,998,0002,531,328
7Aug 18, 2025 12:5610,962116,711,27086,989,0003,999,0002,527,232
8Aug 18, 2025 12:5611,068120,384,89184,872,0006,989,0002,277,376
9Aug 18, 2025 12:5611,175124,591,96486,768,0005,984,0002,281,472
10Aug 18, 2025 12:5611,279123,673,32787,638,0005,975,0002,531,328
11Aug 18, 2025 12:5611,339114,466,98889,111,0005,006,0002,539,520
12Aug 18, 2025 12:5611,751124,582,97290,569,0006,966,0002,531,328