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 8, 2025 03:00Leon ZhaoLeon ZhaoScore: 26,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 03:0026,198239,738,664217,443,00002,285,568
2Aug 8, 2025 03:0026,236243,432,812215,761,0001,997,0002,277,376
3Aug 8, 2025 03:0026,238250,033,290216,775,000998,0002,285,568