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 listOct 2, 2026 04:13Karthik ReddyKarthik ReddyScore: 4,594Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 04:144,53946,642,51936,532,0001,143,0002,113,536
2Oct 2, 2026 04:144,55746,815,08636,696,0001,128,0002,113,536
3Oct 2, 2026 04:144,57746,886,71436,872,0001,118,0002,113,536
4Oct 2, 2026 04:144,58846,878,53837,051,0001,037,0002,113,536
5Oct 2, 2026 04:144,59447,026,92237,009,0001,124,0002,113,536
6Oct 2, 2026 04:144,61747,380,00337,134,0001,189,0002,113,536
7Oct 2, 2026 04:144,62048,801,22137,226,0001,127,0002,113,536
8Oct 2, 2026 04:144,62847,343,25537,302,0001,114,0002,113,536
9Oct 2, 2026 04:144,64547,459,31737,516,0001,042,0002,113,536