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 28, 2026 15:57Victor MerckléVictor MerckléScore: 6,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 15:586,57563,055,15953,467,0001,112,0002,113,536
2Aug 28, 2026 15:586,59063,111,19953,604,0001,096,0002,113,536
3Aug 28, 2026 15:586,59463,168,85453,578,0001,153,0002,113,536
4Aug 28, 2026 15:586,59963,154,76153,669,0001,110,0002,113,536
5Aug 28, 2026 15:586,61063,282,00253,752,0001,111,0002,113,536
6Aug 28, 2026 15:586,65064,841,48154,099,0001,102,0002,113,536
7Aug 28, 2026 15:586,67464,012,27154,276,0001,126,0002,113,536
8Aug 28, 2026 15:586,69463,953,49354,450,0001,112,0002,113,536
9Aug 28, 2026 15:586,75165,142,84554,924,0001,116,0002,113,536