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 listMay 29, 2025 12:38GabriellaGabriellaScore: 71,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2025 12:3870,938610,892,717526,810,00061,977,0002,289,664
2May 29, 2025 12:3871,024614,619,672534,546,00054,953,0002,273,280
3May 29, 2025 12:3871,127618,877,156522,317,00068,041,0002,277,376
4May 29, 2025 12:3871,481622,926,586525,373,00067,918,0002,289,664
5May 29, 2025 12:3871,499616,672,774527,505,00065,938,0002,289,664
6May 29, 2025 12:3871,507616,165,273527,565,00065,945,0002,281,472
7May 29, 2025 12:3871,575618,500,120537,067,00057,007,0002,506,752
8May 29, 2025 12:3871,910619,854,845530,868,00065,983,0002,281,472
9May 29, 2025 12:3872,480626,573,235542,622,00058,958,0002,289,664