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 17, 2026 18:25timothygktimothygkScore: 32,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 18:2832,027276,675,198264,740,0001,092,0002,117,632stderr
2Oct 17, 2026 18:2832,037276,815,401264,811,0001,102,0002,117,632stderr
3Oct 17, 2026 18:2832,046277,091,613264,977,0001,005,0002,117,632stderr
4Oct 17, 2026 18:2832,062277,563,158265,022,0001,100,0002,117,632stderr
5Oct 17, 2026 18:2832,075277,212,981265,218,0001,010,0002,117,632stderr
6Oct 17, 2026 18:2832,125292,678,364265,599,0001,044,0002,117,632stderr
7Oct 17, 2026 18:2832,163289,879,168265,941,0001,019,0002,117,632stderr
8Oct 17, 2026 18:2832,231289,276,000266,458,0001,066,0002,117,632stderr
9Oct 17, 2026 18:2832,815283,313,589271,364,0001,006,0002,117,632stderr