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 listMar 4, 2026 07:35DanielDanielScore: 38,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 07:3538,275346,120,712315,682,0001,997,0002,359,296
2Mar 4, 2026 07:3538,438347,559,740317,039,0002,000,0002,293,760
3Mar 4, 2026 07:3538,450340,504,523318,136,0001,000,0002,293,760
4Mar 4, 2026 07:3538,464341,394,347318,252,0001,000,0002,367,488
5Mar 4, 2026 07:3538,474343,595,660318,337,0001,001,0002,347,008
6Mar 4, 2026 07:3538,475347,581,365318,344,0001,001,0002,359,296
7Mar 4, 2026 07:3538,480344,947,932318,379,0001,001,0002,289,664
8Mar 4, 2026 07:3538,571346,642,634318,138,0002,000,0002,355,200
9Mar 4, 2026 07:3538,702346,409,850319,227,0002,001,0002,293,760