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 9, 2025 08:25Ashish AhujaAshish AhujaScore: 2,303,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 22:362,301,20719,141,875,54218,743,205,000356,813,0002,424,832
2Aug 9, 2025 08:252,301,83319,150,761,31418,724,427,000380,784,0002,445,312
3Aug 8, 2025 22:362,302,78819,160,177,28218,772,333,000340,806,0002,420,736
4Aug 8, 2025 22:372,302,82019,161,577,21218,767,612,000345,790,0002,420,736
5Aug 8, 2025 22:362,303,14319,159,689,28618,739,299,000376,784,0002,490,368
6Aug 8, 2025 22:372,303,41819,162,787,15518,762,565,000355,802,0002,412,544
7Aug 9, 2025 08:252,306,08019,188,262,15118,763,668,000376,792,0002,502,656
8Aug 9, 2025 08:252,337,20319,442,120,22419,004,996,000393,792,0002,494,464
9Aug 8, 2025 22:372,371,79619,731,265,56919,321,074,000364,831,0002,416,640