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 listNov 21, 2025 08:40Rajarshi BasuRajarshi BasuScore: 53,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 08:4053,446472,477,925441,601,0001,998,0002,289,664
2Nov 21, 2025 08:4053,450471,240,864441,634,0001,998,0002,289,664
3Nov 21, 2025 08:4053,454472,034,437441,668,0001,998,0002,289,664
4Nov 21, 2025 08:4053,457465,356,319441,698,0001,998,0002,273,280
5Nov 21, 2025 08:4053,469468,152,766441,796,0001,999,0002,273,280
6Nov 21, 2025 08:4053,473468,298,889441,825,0001,999,0002,379,776
7Nov 21, 2025 08:4053,473469,581,755441,831,0001,999,0002,289,664
8Nov 21, 2025 08:4053,480471,999,004442,887,000999,0002,289,664
9Nov 21, 2025 08:4053,481469,401,694441,893,0001,999,0002,289,664