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 17, 2025 09:02Ashish AhujaAshish AhujaScore: 15,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 09:0114,942153,644,763115,015,0009,001,0002,412,544
2Aug 17, 2025 09:0115,006152,029,590118,571,0005,978,0002,351,104
3Aug 17, 2025 09:0015,034149,841,065111,808,00012,977,0002,375,680
4Aug 17, 2025 09:0015,077155,071,038112,123,00013,014,0002,375,680
5Aug 17, 2025 09:0215,101149,167,393111,413,00013,926,0002,371,584
6Aug 17, 2025 09:0215,174154,684,157115,948,0009,995,0002,273,280
7Aug 17, 2025 09:0115,194152,461,642114,102,00012,010,0002,424,832
8Aug 17, 2025 09:0015,486152,320,733117,577,00010,960,0002,412,544
9Aug 17, 2025 09:0215,827162,399,696117,433,00013,932,0002,412,544