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 14, 2025 14:38Andrija ZarićAndrija ZarićScore: 52,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2025 14:3852,802464,113,433437,260,0001,000,0002,289,664
2Aug 14, 2025 14:3852,807461,759,142438,302,00002,289,664
3Aug 14, 2025 14:3852,809467,258,273437,314,0001,000,0002,293,760
4Aug 14, 2025 14:3852,815464,995,469437,361,0001,000,0002,367,488
5Aug 14, 2025 14:3852,821467,751,042438,413,00002,367,488
6Aug 14, 2025 14:3852,822464,333,133437,425,0001,000,0002,355,200
7Aug 14, 2025 14:3852,823468,509,349436,432,0001,997,0002,293,760
8Aug 14, 2025 14:3852,826464,187,847438,456,00002,289,664
9Aug 14, 2025 14:3852,828468,387,086438,475,00002,289,664