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 11, 2026 07:54RabenknechtRabenknechtScore: 100,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 07:54100,143841,587,405682,489,000148,705,0002,113,536
2Aug 11, 2026 07:54100,146841,117,094682,637,000148,575,0002,113,536
3Aug 11, 2026 07:54100,303842,445,237682,460,000150,055,0002,113,536
4Aug 11, 2026 07:54100,336842,807,542682,227,000150,565,0002,113,536
5Aug 11, 2026 07:54100,379843,082,610682,629,000150,521,0002,113,536
6Aug 11, 2026 07:54100,412843,256,185682,773,000150,649,0002,113,536
7Aug 11, 2026 07:54100,562845,674,402682,774,000151,898,0002,113,536
8Aug 11, 2026 07:54100,641845,262,954682,358,000152,966,0002,113,536
9Aug 11, 2026 07:54101,258850,469,914682,453,000157,989,0002,113,536