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 22, 2026 16:24timothygktimothygkScore: 42,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2026 16:2442,389363,279,166104,688,000247,144,0002,740,224stderr
2Oct 22, 2026 16:2442,417363,121,155104,578,000247,488,0002,740,224stderr
3Oct 22, 2026 16:2442,501363,700,687105,349,000247,417,0002,740,224stderr
4Oct 22, 2026 16:2442,642365,274,948104,732,000249,199,0002,740,224stderr
5Oct 22, 2026 16:2442,691365,696,984104,939,000249,402,0002,740,224stderr
6Oct 22, 2026 16:2442,765365,915,097104,964,000249,987,0002,740,224stderr
7Oct 22, 2026 16:2442,806366,159,127104,940,000250,351,0002,740,224stderr
8Oct 22, 2026 16:2442,850367,056,354104,601,000251,062,0002,740,224stderr
9Oct 22, 2026 16:2443,345371,063,595105,933,000253,835,0002,740,224stderr