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 14, 2026 17:53timothygktimothygkScore: 115,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 17:53115,297967,414,011728,161,000228,812,0002,113,536
2Oct 14, 2026 17:53115,417968,525,343728,136,000229,833,0002,113,536
3Oct 14, 2026 17:53115,424968,551,454728,125,000229,899,0002,113,536
4Oct 14, 2026 17:53115,816971,794,345733,008,000228,272,0002,113,536
5Oct 14, 2026 17:53115,879972,753,943733,164,000228,633,0002,113,536
6Oct 14, 2026 17:53116,082974,056,264738,560,000224,921,0002,113,536
7Oct 14, 2026 17:53116,454977,094,232740,689,000225,885,0002,113,536
8Oct 14, 2026 17:53116,955981,572,007740,517,000230,213,0002,113,536
9Oct 14, 2026 17:53117,071982,358,946739,717,000231,975,0002,113,536