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:40Daniel MastalerzDaniel MastalerzScore: 4,614Success
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:414,60747,773,13737,201,0001,042,0002,113,536
2Jun 27, 2026 13:414,61147,755,92237,235,0001,041,0002,113,536
3Jun 27, 2026 13:414,61247,803,42337,243,0001,039,0002,113,536
4Jun 27, 2026 13:414,61447,778,92137,262,0001,037,0002,113,536
5Jun 27, 2026 13:414,61447,841,83537,261,0001,037,0002,113,536
6Jun 27, 2026 13:414,61748,199,19537,253,0001,071,0002,113,536
7Jun 27, 2026 13:414,61747,816,01837,294,0001,031,0002,113,536
8Jun 27, 2026 13:414,64048,053,13837,473,0001,044,0002,113,536
9Jun 27, 2026 13:414,67148,319,61737,725,0001,047,0002,113,536