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 18:22RyhbtRyhbtScore: 67,815Success
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 18:2266,892578,297,249554,200,0001,000,0002,277,376
2Aug 8, 2025 18:2267,779589,076,223560,566,0001,998,0002,281,472
3Aug 8, 2025 18:2267,794586,257,072559,693,0002,998,0002,277,376
4Aug 8, 2025 18:2267,796585,812,342560,709,0001,998,0002,506,752
5Aug 8, 2025 18:2267,815587,143,369558,867,0003,999,0002,281,472
6Aug 8, 2025 18:2267,816585,963,966560,877,0001,999,0002,506,752
7Aug 8, 2025 18:2269,469602,304,366574,593,0001,998,0002,506,752
8Aug 8, 2025 18:2274,255643,939,647615,316,0001,000,0002,289,664
9Aug 8, 2025 18:2274,759645,844,665617,500,0002,997,0002,281,472