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:29Leon ZhaoLeon ZhaoScore: 34,748Success
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:2934,722315,704,559287,192,0001,000,0002,285,568
2Aug 7, 2025 23:2934,725317,023,095287,220,0001,000,0002,260,992
3Aug 7, 2025 23:2934,726313,285,297287,225,0001,000,0002,285,568
4Aug 7, 2025 23:2934,740311,349,831286,343,0002,002,0002,285,568
5Aug 7, 2025 23:2934,748312,156,013287,410,0001,001,0002,277,376
6Aug 7, 2025 23:2934,761316,011,557287,518,0001,001,0002,285,568
7Aug 7, 2025 23:2934,762313,424,239286,526,0001,996,0002,285,568
8Aug 7, 2025 23:2934,766314,575,790287,563,000998,0002,285,568
9Aug 7, 2025 23:2934,781314,205,100286,688,0001,997,0002,285,568