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 27, 2026 16:51Victor MerckléVictor MerckléScore: 4,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 16:534,30544,712,45333,189,0002,545,0002,113,536
2Aug 27, 2026 16:534,32444,249,56933,309,0002,585,0002,113,536
3Aug 27, 2026 16:534,33144,308,91333,394,0002,559,0002,113,536
4Aug 27, 2026 16:534,35344,496,11433,636,0002,502,0002,113,536
5Aug 27, 2026 16:534,35445,160,74933,588,0002,558,0002,113,536
6Aug 27, 2026 16:534,40044,881,36833,936,0002,584,0002,113,536
7Aug 27, 2026 16:534,44345,852,73034,462,0002,421,0002,113,536
8Aug 27, 2026 16:534,52346,558,16535,104,0002,441,0002,113,536
9Aug 27, 2026 16:534,53753,960,98235,571,0002,087,0002,113,536