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 17, 2025 15:30Ashish AhujaAshish AhujaScore: 13,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 15:3013,658138,648,184104,332,0009,028,0002,478,080
2Aug 17, 2025 15:3013,677139,488,406105,550,0007,966,0002,506,752
3Aug 17, 2025 15:3013,705141,668,491105,768,0007,982,0002,506,752
4Aug 17, 2025 15:3013,779138,681,520106,341,0008,025,0002,277,376
5Aug 17, 2025 15:3013,864138,092,295107,065,0008,004,0002,330,624
6Aug 17, 2025 15:3013,873135,213,598106,131,0009,011,0002,273,280
7Aug 17, 2025 15:3013,913139,209,859107,518,0007,964,0002,330,624
8Aug 17, 2025 15:3014,025140,391,366106,461,0009,949,0002,347,008
9Aug 17, 2025 15:3014,098144,043,911109,015,0008,001,0002,359,296