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 listDec 19, 2025 19:45Zhalgas KhassenovZhalgas KhassenovScore: 1,876,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 19:451,871,52215,572,589,88615,406,710,000126,923,0002,502,656
2Dec 19, 2025 19:451,872,67815,585,016,82315,426,310,000116,918,0002,310,144
3Dec 19, 2025 19:451,873,25415,586,707,74415,421,105,000126,902,0002,342,912
4Dec 19, 2025 19:451,873,97215,592,092,44015,459,033,00094,932,0002,531,328
5Dec 19, 2025 19:451,876,01815,606,746,73115,455,027,000115,925,0002,539,520
6Dec 19, 2025 19:451,876,76515,614,409,77515,456,238,000120,915,0002,347,008
7Dec 19, 2025 19:451,891,19415,736,291,18215,578,015,000118,893,0002,306,048
8Dec 19, 2025 19:451,891,53315,733,114,47815,598,793,000100,933,0002,347,008
9Dec 19, 2025 19:451,891,63115,745,508,22815,584,614,000115,922,0002,347,008