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 listApr 21, 2026 20:45Charles CabergsCharles CabergsScore: 20,993Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 20:4520,255186,240,951165,121,0003,002,0002,523,136stderr
2Apr 21, 2026 20:4520,255191,788,768165,120,0003,002,0002,502,656stderr
3Apr 21, 2026 20:4520,287183,610,425166,382,0002,004,0002,310,144stderr
4Apr 21, 2026 20:4520,983187,834,048172,164,0002,001,0002,318,336stderr
5Apr 21, 2026 20:4520,993194,571,328172,242,0002,002,0002,519,040stderr
6Apr 21, 2026 20:4521,011191,199,526172,389,0002,004,0002,527,232stderr
7Apr 21, 2026 20:4521,012193,406,929172,402,0002,004,0002,506,752stderr
8Apr 21, 2026 20:4521,025194,564,370171,521,0002,991,0002,519,040stderr
9Apr 21, 2026 20:4521,039192,592,135171,632,0002,993,0002,338,816stderr