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 18, 2026 20:11wnwnScore: 7,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 20:116,12070,084,96047,805,0002,987,0002,502,656
2Feb 18, 2026 20:116,12773,027,72347,864,0002,991,0002,506,752
3Feb 18, 2026 20:116,15674,923,50649,092,0002,003,0002,289,664
4Feb 18, 2026 20:117,20686,736,56259,810,00002,433,024
5Feb 18, 2026 20:117,40382,482,86158,426,0003,022,0002,396,160
6Feb 18, 2026 20:117,41286,440,07458,495,0003,025,0002,392,064