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 listMar 15, 2026 09:51hwhwScore: 54,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 09:5154,148484,214,920447,430,0001,997,0002,281,472
2Mar 15, 2026 09:5154,148474,417,184448,427,0001,000,0002,383,872
3Mar 15, 2026 09:5154,156476,015,629447,499,0001,997,0002,277,376
4Mar 15, 2026 09:5154,165477,997,277448,571,000999,0002,277,376
5Mar 15, 2026 09:5154,173475,861,051447,639,0001,998,0002,281,472
6Mar 15, 2026 09:5154,195475,959,749449,820,00002,265,088
7Mar 15, 2026 09:5154,212472,304,872446,957,0002,999,0002,277,376
8Mar 15, 2026 09:5154,277477,487,715448,497,0002,002,0002,260,992
9Mar 15, 2026 09:5154,292475,460,025449,625,000999,0002,379,776