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 listJun 27, 2026 13:30Daniel MastalerzDaniel MastalerzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:31045,698,38935,034,0001,036,0002,113,536expected "53676145953403876 ", got "53676145953147876"
2Jun 27, 2026 13:314,33445,432,21934,956,0001,023,0002,113,536
3Jun 27, 2026 13:314,33445,403,74234,937,0001,037,0002,113,536
4Jun 27, 2026 13:314,33845,445,34834,982,0001,027,0002,113,536
5Jun 27, 2026 13:314,34145,533,21135,006,0001,031,0002,113,536
6Jun 27, 2026 13:314,34945,548,11035,063,0001,040,0002,113,536
7Jun 27, 2026 13:314,35745,641,63835,116,0001,051,0002,113,536
8Jun 27, 2026 13:314,38345,865,18135,341,0001,043,0002,113,536
9Jun 27, 2026 13:314,38545,920,47435,369,0001,033,0002,113,536