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 27, 2026 19:41BrillentypBrillentypScore: 396,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 19:41395,1873,309,312,1323,210,094,00069,958,0002,281,472
2Mar 27, 2026 19:41395,3653,313,311,5763,218,556,00062,971,0002,281,472
3Mar 27, 2026 19:41395,5803,310,437,1623,217,346,00065,966,0002,281,472
4Mar 27, 2026 19:41395,8713,307,868,6043,210,758,00074,971,0002,281,472
5Mar 27, 2026 19:41396,0743,317,792,2913,217,472,00069,945,0002,281,472
6Mar 27, 2026 19:41396,8403,320,403,1573,218,824,00074,949,0002,281,472
7Mar 27, 2026 19:41397,3143,324,396,0253,232,753,00064,954,0002,289,664
8Mar 27, 2026 19:41400,5123,351,470,2313,259,281,00064,965,0002,281,472
9Mar 27, 2026 19:41401,7713,364,679,2393,275,742,00058,959,0002,281,472