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:13Rajarshi BasuRajarshi BasuScore: 6,377Success
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:136,25081,843,85749,880,0001,995,0002,265,088
2Dec 6, 2025 15:136,25375,392,06449,905,0001,996,0002,383,872
3Dec 6, 2025 15:136,25684,931,23349,929,0001,997,0002,277,376
4Dec 6, 2025 15:136,37784,172,35250,933,0001,997,0002,289,664
5Dec 6, 2025 15:136,38782,491,65250,012,0003,000,0002,506,752
6Dec 6, 2025 15:136,44577,869,39152,481,0001,009,0002,277,376