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 listAug 29, 2025 07:54Adam FolwarcznyAdam FolwarcznyScore: 10,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2025 07:5410,588113,478,89446,408,00041,471,0002,334,720
2Aug 29, 2025 07:5410,612115,438,09046,515,00041,567,0002,449,408
3Aug 29, 2025 07:5410,693112,955,17250,295,00038,461,0002,318,336
4Aug 29, 2025 07:5410,705116,587,00853,310,00035,540,0002,392,064
5Aug 29, 2025 07:5410,759113,808,54550,048,00039,253,0002,428,928
6Aug 29, 2025 07:5410,765114,596,62853,019,00036,327,0002,433,024
7Aug 29, 2025 07:5410,768113,376,45049,109,00040,269,0002,424,832
8Aug 29, 2025 07:5410,795114,416,83451,199,00038,399,0002,363,392
9Aug 29, 2025 07:5410,814118,516,25950,305,00039,455,0002,437,120
10Aug 29, 2025 07:5410,827117,506,75953,327,00036,539,0002,428,928
11Aug 29, 2025 07:5410,861122,386,18754,484,00035,662,0002,453,504
12Aug 29, 2025 07:5410,875116,013,02150,039,00040,227,0002,375,680