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 listMay 15, 2025 21:29T PrathamT PrathamScore: 66,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2025 21:2966,124573,141,951546,831,0001,999,0002,277,376
2May 15, 2025 21:2966,125580,677,288546,838,0001,999,0002,289,664
3May 15, 2025 21:2966,134571,627,712547,917,000999,0002,281,472
4May 15, 2025 21:2966,143577,921,460546,991,0001,999,0002,523,136
5May 15, 2025 21:2966,143572,052,444546,992,0001,999,0002,273,280
6May 15, 2025 21:2966,160577,695,681547,127,0002,000,0002,289,664
7May 15, 2025 21:2966,160573,179,583548,130,0001,000,0002,289,664
8May 15, 2025 21:2966,161578,312,057548,137,0001,000,0002,281,472
9May 15, 2025 21:2966,163575,716,057547,153,0002,000,0002,289,664