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 20, 2026 12:07Dominique GarmierDominique GarmierScore: 7,913Success
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 16:167,84093,598,39763,074,0002,002,0002,289,664
2Mar 13, 2026 16:167,84591,486,21163,112,0002,003,0002,289,664
3Mar 13, 2026 16:167,84791,699,81063,128,0002,004,0002,289,664
4Mar 13, 2026 16:167,85091,031,35363,154,0002,004,0002,412,544
5Mar 13, 2026 16:167,85387,424,59263,177,0002,005,0002,420,736
6Mar 13, 2026 16:167,90893,947,76564,625,0001,009,0002,289,664
7Mar 13, 2026 16:167,91393,536,62164,671,0001,010,0002,289,664
8Mar 13, 2026 16:167,92997,469,71064,813,000997,0002,289,664
9Mar 13, 2026 16:167,93297,322,51163,839,0001,994,0002,289,664
10Mar 20, 2026 12:078,501101,931,24170,556,00002,289,664
11Mar 20, 2026 12:078,51695,299,64169,674,0001,009,0002,498,560
12Mar 20, 2026 12:078,66898,953,73670,947,000999,0002,289,664