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 00:46Elijah KinElijah KinScore: 57,880Success
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 00:4657,740503,083,882423,214,00056,028,0002,285,568
2Mar 18, 2026 00:4657,846501,697,314419,107,00061,015,0002,277,376
3Mar 18, 2026 00:4657,852502,561,812431,156,00049,017,0002,478,080
4Mar 18, 2026 00:4657,862502,598,509429,226,00051,026,0002,482,176
5Mar 18, 2026 00:4657,880509,695,342421,476,00058,926,0002,281,472
6Mar 18, 2026 00:4657,935504,239,462429,878,00050,985,0002,277,376
7Mar 18, 2026 00:4657,959512,229,778428,054,00053,006,0002,482,176
8Mar 18, 2026 00:4658,047504,291,270424,812,00056,974,0002,473,984
9Mar 18, 2026 00:4658,796515,954,793418,008,00070,001,0002,285,568