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 15, 2025 13:40Aniruddha DebAniruddha DebScore: 20,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2025 13:4020,760194,968,044171,309,0001,001,0002,269,184
2Feb 15, 2025 13:4120,767195,071,580172,369,00002,531,328
3Feb 15, 2025 13:4120,767195,444,187171,361,0001,002,0002,531,328
4Feb 15, 2025 13:4120,768196,829,150172,376,00002,531,328
5Feb 15, 2025 13:4020,777193,107,658172,449,00002,269,184
6Feb 15, 2025 13:4020,785199,680,479171,520,000997,0002,531,328