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 16, 2025 22:56Ashish AhujaAshish AhujaScore: 15,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 22:5614,944156,286,758109,030,00015,004,0002,416,640
2Aug 16, 2025 22:5614,990150,301,786112,475,00011,944,0002,322,432
3Aug 16, 2025 22:5615,120158,943,679113,541,00011,951,0002,506,752
4Aug 16, 2025 22:5615,130156,596,377109,629,00015,946,0002,277,376
5Aug 16, 2025 22:5615,478158,301,654113,531,00014,938,0002,334,720
6Aug 16, 2025 22:5615,509153,597,751115,751,00012,972,0002,310,144
7Aug 16, 2025 22:5615,516160,039,945114,804,00013,976,0002,359,296
8Aug 16, 2025 22:5615,557160,522,435117,111,00012,011,0002,510,848
9Aug 16, 2025 22:5615,777158,668,552113,953,00016,993,0002,424,832