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 17, 2026 20:46wnwnScore: 7,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 20:466,27374,403,35549,061,0003,003,0002,502,656
2Feb 17, 2026 20:466,28379,615,40650,144,0002,005,0002,506,752
3Feb 17, 2026 20:466,41377,918,70551,223,0002,008,0002,457,600
4Feb 17, 2026 20:467,17386,673,26656,512,0003,027,0002,408,448
5Feb 17, 2026 20:467,35091,851,18358,005,0003,000,0002,400,256
6Feb 17, 2026 20:467,41289,180,12058,496,0003,025,0002,420,736