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 listFeb 16, 2026 20:47wnwnScore: 8,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 20:478,70895,033,58170,272,0002,007,0002,383,872
2Feb 16, 2026 20:478,801102,068,69170,045,0003,001,0002,375,680
3Feb 16, 2026 20:479,020101,616,19770,871,0003,992,0002,408,448