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 listDec 6, 2025 15:29Rajarshi BasuRajarshi BasuScore: 6,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:296,12578,440,84449,843,000996,0002,281,472
2Dec 6, 2025 15:296,24182,411,63450,801,000996,0002,281,472
3Dec 6, 2025 15:296,24777,518,60348,856,0002,991,0002,273,280
4Dec 6, 2025 15:296,25476,767,96749,913,0001,996,0002,273,280
5Dec 6, 2025 15:296,26374,556,36549,983,0001,999,0002,273,280
6Dec 6, 2025 15:296,26577,502,00050,999,000999,0002,289,664