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 28, 2026 08:57Benji WhiteBenji WhiteScore: 147,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 08:57147,6371,261,023,188872,561,000352,822,0002,457,600
2Feb 28, 2026 08:57147,7251,261,237,674887,636,000338,479,0002,478,080
3Feb 28, 2026 08:57147,7461,264,600,048883,488,000342,801,0002,441,216
4Feb 28, 2026 08:57147,7531,267,117,188862,837,000363,510,0002,428,928
5Feb 28, 2026 08:57147,8291,267,820,582872,850,000354,128,0002,433,024
6Feb 28, 2026 08:57147,8461,262,023,471884,922,000342,196,0002,449,408
7Feb 28, 2026 08:57147,9341,266,245,830880,180,000347,676,0002,428,928
8Feb 28, 2026 08:57148,0111,264,261,468916,382,000312,108,0002,449,408
9Feb 28, 2026 08:57148,4001,259,604,331893,074,000338,648,0002,441,216