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 1, 2026 14:55George SeabridgeGeorge SeabridgeScore: 77,595Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 14:5660,447511,975,890500,635,0001,081,0002,113,536
2Aug 1, 2026 14:5672,072609,426,448597,112,0001,090,0002,113,536
3Aug 1, 2026 14:5672,312610,188,882599,095,0001,095,0002,113,536
4Aug 1, 2026 14:5672,659613,055,034602,063,0001,012,0002,113,536
5Aug 1, 2026 14:5677,595654,334,599642,957,0001,082,0002,113,536
6Aug 1, 2026 14:5681,919689,840,389678,727,0001,205,0002,113,536
7Aug 1, 2026 14:5682,943698,362,944687,346,0001,086,0002,113,536
8Aug 1, 2026 14:5686,165725,202,410714,088,0001,089,0002,113,536
9Aug 1, 2026 14:5694,948798,106,522786,974,0001,101,0002,113,536