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 13, 2026 10:49Dominique GarmierDominique GarmierScore: 25,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 10:4925,020236,012,023207,665,00002,273,280
2Mar 13, 2026 10:4925,023233,101,070206,689,000998,0002,273,280
3Mar 13, 2026 10:4925,024234,315,649206,698,000998,0002,273,280
4Mar 13, 2026 10:4925,025232,595,816205,713,0001,997,0002,273,280
5Mar 13, 2026 10:4925,026232,327,417205,716,0001,997,0002,392,064
6Mar 13, 2026 10:4925,030231,137,015206,748,000998,0002,396,160
7Mar 13, 2026 10:4925,030235,188,576207,750,00002,396,160
8Mar 13, 2026 10:4925,031232,633,251205,758,0001,997,0002,400,256
9Mar 13, 2026 10:4925,036239,103,208205,798,0001,998,0002,273,280