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 1, 2025 19:08Rajarshi BasuRajarshi BasuScore: 12,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2025 19:0812,436128,158,974100,211,0003,006,0002,371,584
2Dec 1, 2025 19:0812,441126,279,562101,253,0002,005,0002,289,664
3Dec 1, 2025 19:0812,514137,024,503100,874,0002,996,0002,383,872
4Dec 1, 2025 19:0812,515135,701,927102,879,000998,0002,367,488
5Dec 1, 2025 19:0812,525132,924,731101,958,0001,999,0002,289,664
6Dec 1, 2025 19:0812,530136,568,375101,001,0003,000,0002,289,664
7Dec 1, 2025 19:0812,533133,771,247102,024,0002,000,0002,379,776
8Dec 1, 2025 19:0812,544130,076,598102,113,0002,002,0002,379,776
9Dec 1, 2025 19:0812,758133,771,623104,895,000999,0002,285,568