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 11, 2025 18:52Leon ZhaoLeon ZhaoScore: 12,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 18:5212,363134,128,039102,613,00002,285,568
2Aug 11, 2025 20:0012,363128,419,461102,617,00002,285,568
3Aug 11, 2025 20:0012,374129,407,704100,712,0001,994,0002,469,888
4Aug 11, 2025 18:5212,379129,803,332100,749,0001,995,0002,314,240
5Aug 11, 2025 18:5212,380130,961,695101,760,000997,0002,285,568
6Aug 11, 2025 20:0012,390130,583,08999,843,0002,995,0002,465,792