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 16, 2025 22:50Ashish AhujaAshish AhujaScore: 16,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 22:5015,859161,006,256106,699,00024,929,0003,977,216
2Aug 16, 2025 22:5015,965162,908,807110,591,00021,919,0003,977,216
3Aug 16, 2025 22:5015,996159,025,629107,810,00024,956,0003,989,504
4Aug 16, 2025 22:5016,023162,949,475110,992,00021,998,0004,026,368
5Aug 16, 2025 22:5016,094167,393,897111,653,00021,931,0004,202,496
6Aug 16, 2025 22:5016,256165,043,408114,934,00019,988,0003,989,504
7Aug 16, 2025 22:5016,325163,852,082114,574,00020,922,0004,022,272
8Aug 16, 2025 22:5016,609164,217,427115,878,00021,976,0004,177,920
9Aug 16, 2025 22:5016,830169,226,277116,737,00022,948,0003,989,504