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 24, 2026 17:06timothygktimothygkScore: 9,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 17:109,45990,643,41668,079,00010,433,0002,117,632stderr
2Oct 24, 2026 17:109,49690,439,35168,375,00010,450,0002,117,632stderr
3Oct 24, 2026 17:109,56290,348,15968,114,00011,258,0002,117,632stderr
4Oct 24, 2026 17:109,58490,712,97668,618,00010,931,0002,117,632stderr
5Oct 24, 2026 17:109,59691,118,76568,781,00010,872,0002,117,632stderr
6Oct 24, 2026 17:109,63490,926,86769,100,00010,865,0002,117,632stderr
7Oct 24, 2026 17:109,63691,401,03968,801,00011,179,0002,117,632stderr
8Oct 24, 2026 17:109,64491,520,48969,129,00010,918,0002,117,632stderr
9Oct 24, 2026 17:109,74391,811,86569,242,00011,626,0002,117,632stderr