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 18, 2026 02:34Yuriy LyfenkoYuriy LyfenkoScore: 5,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 02:345,36570,027,18343,520,0001,012,0002,310,144
2Mar 18, 2026 02:345,36867,288,62942,529,0002,025,0002,301,952
3Mar 18, 2026 02:345,37972,560,04843,633,0001,014,0002,285,568
4Mar 18, 2026 02:345,52574,791,25043,864,0001,993,0002,269,184
5Mar 18, 2026 02:345,54070,147,46342,981,0002,998,0002,285,568
6Mar 18, 2026 02:345,59074,404,01543,374,0003,026,0002,293,760
7Mar 18, 2026 02:345,59673,659,37745,440,0001,009,0002,285,568
8Mar 18, 2026 02:345,59872,973,49844,447,0002,020,0002,301,952
9Mar 18, 2026 02:345,64378,477,36245,843,000996,0002,285,568