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 31, 2026 11:23timothygktimothygkScore: 10,927Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 11:2810,56398,687,29274,940,00012,734,0002,150,400stderr
2Oct 31, 2026 11:2810,56698,550,85975,021,00012,680,00053,248stderr
3Oct 31, 2026 11:2810,770100,972,16676,139,00013,260,00053,248stderr
4Oct 31, 2026 11:2810,862101,128,96977,589,00012,570,00053,248stderr
5Oct 31, 2026 11:2810,927103,209,44178,200,00012,502,0002,150,400stderr
6Oct 31, 2026 11:2811,093103,022,10079,276,00012,801,00053,248stderr
7Oct 31, 2026 11:2811,117104,370,81879,424,00012,849,00053,248stderr
8Oct 31, 2026 11:2811,144103,501,94379,668,00012,835,00053,248stderr
9Oct 31, 2026 11:2811,176103,848,61479,881,00012,886,0002,150,400stderr