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 listJul 7, 2026 04:54wnwnScore: 3,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:013,29635,225,59526,309,0001,055,0002,113,536
2Jul 7, 2026 05:013,33035,441,36326,608,0001,033,0002,113,536
3Jul 7, 2026 05:013,41736,190,51027,342,0001,022,0002,113,536
4Jul 7, 2026 05:013,45137,044,36027,638,0001,008,0002,113,536
5Jul 7, 2026 05:013,45737,159,94627,673,0001,021,0002,113,536
6Jul 7, 2026 05:013,49436,816,99927,963,0001,043,0002,113,536
7Jul 7, 2026 05:013,50036,870,41428,044,0001,009,0002,113,536
8Jul 7, 2026 05:013,62945,676,23429,111,0001,017,0002,113,536
9Jul 7, 2026 05:013,67848,214,49529,464,0001,065,0002,113,536