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 18:45wnwnScore: 8,406Success
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 18:457,48988,048,24058,151,0004,010,0002,338,816
2Feb 16, 2026 18:457,60090,383,42961,079,0002,002,0002,514,944
3Feb 16, 2026 18:457,84693,834,50562,118,0003,005,0002,265,088
4Feb 16, 2026 18:458,34490,584,92066,245,0003,011,0002,441,216
5Feb 16, 2026 18:458,35892,282,17666,355,0003,016,0002,445,312
6Feb 16, 2026 18:458,38298,789,33766,548,0003,024,0002,412,544
7Feb 16, 2026 18:458,406100,497,11067,773,0001,993,0002,408,448
8Feb 16, 2026 18:458,45595,027,38066,164,0004,009,0002,437,120
9Feb 16, 2026 18:458,46993,736,91867,279,0003,012,0002,437,120
10Feb 16, 2026 18:458,53899,781,34167,872,0002,994,0002,469,888
11Feb 16, 2026 18:458,65098,781,38467,806,0003,988,0002,445,312
12Feb 16, 2026 18:458,650102,183,63568,803,0002,991,0002,424,832