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 listMar 10, 2026 21:50Daniel MastalerzDaniel MastalerzScore: 5,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 21:505,34267,814,72141,318,0003,023,0002,285,568
2Mar 10, 2026 21:505,34871,043,76041,361,0003,026,0002,428,928
3Mar 10, 2026 21:505,34970,264,97541,372,0003,027,0002,416,640
4Mar 10, 2026 21:505,35668,960,16043,447,0001,010,0002,412,544
5Mar 10, 2026 21:505,35765,397,58642,444,0002,021,0002,285,568
6Mar 10, 2026 21:505,36071,063,25243,475,0001,011,0002,416,640
7Mar 10, 2026 21:505,36468,694,89543,508,0001,011,0002,285,568
8Mar 10, 2026 21:505,36568,409,77041,493,0003,036,0002,412,544
9Mar 10, 2026 21:505,40169,695,44842,837,0001,992,0002,420,736
10Mar 10, 2026 21:505,49070,948,19743,539,0002,025,0002,285,568
11Mar 10, 2026 21:505,49769,207,70244,610,0001,013,0002,408,448
12Mar 10, 2026 21:505,53772,775,06843,961,0001,998,0002,285,568