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 11, 2025 03:34Marco BarboneMarco BarboneScore: 30,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 03:3428,608267,671,709236,445,0001,001,0002,289,664
2Oct 11, 2025 03:3428,615267,807,744237,507,00002,289,664
3Oct 11, 2025 03:3430,134275,004,275248,109,0002,000,0002,289,664
4Oct 11, 2025 03:3430,139270,333,481248,154,0002,001,0002,379,776
5Oct 11, 2025 03:3430,151277,905,341249,253,0001,001,0002,289,664
6Oct 11, 2025 03:3430,152272,381,853248,262,0002,002,0002,269,184
7Oct 11, 2025 03:3430,167280,026,038249,385,0001,001,0002,273,280
8Oct 11, 2025 03:3430,169276,235,178249,398,0001,001,0002,289,664
9Oct 11, 2025 03:3430,202276,918,778248,677,0001,997,0002,289,664