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 7, 2025 23:23Leon ZhaoLeon ZhaoScore: 35,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2025 23:2335,820320,091,073296,302,0001,001,0002,265,088
2Aug 7, 2025 23:2335,823319,527,817296,332,0001,001,0002,285,568
3Aug 7, 2025 23:2335,831329,828,789296,394,0001,001,0002,285,568
4Aug 7, 2025 23:2335,834322,591,798296,424,0001,001,0002,273,280
5Aug 7, 2025 23:2335,839328,636,310296,465,0001,001,0002,285,568
6Aug 7, 2025 23:2335,853326,641,078296,579,0001,001,0002,285,568
7Aug 7, 2025 23:2335,862327,251,234295,657,0001,997,0002,260,992
8Aug 7, 2025 23:2335,864331,606,917295,675,0001,997,0002,285,568
9Aug 7, 2025 23:2335,864327,544,302296,676,000998,0002,269,184