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 listFeb 3, 2026 14:29RuszrokRuszrokScore: 17,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 14:2917,646174,256,987145,458,0001,003,0002,277,376
2Feb 3, 2026 14:2917,915176,039,446147,698,000997,0002,277,376
3Feb 3, 2026 14:2917,918175,037,237147,722,000998,0002,400,256
4Feb 3, 2026 14:2917,921174,748,164147,750,000998,0002,277,376
5Feb 3, 2026 14:2917,921175,050,816146,747,0001,996,0002,400,256
6Feb 3, 2026 14:2917,929172,285,532146,813,0001,997,0002,277,376
7Feb 3, 2026 14:2917,931177,514,267146,829,0001,997,0002,277,376
8Feb 3, 2026 14:2917,933171,876,693147,843,000998,0002,277,376
9Feb 3, 2026 14:2917,952170,365,460147,002,0002,000,0002,392,064