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 09:26promix1722promix1722Score: 65,895Success
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 09:2665,802566,946,495546,159,00002,498,560
2Feb 3, 2026 09:2665,857571,889,259545,618,000999,0002,519,040
3Feb 3, 2026 09:2665,884575,744,056545,838,000999,0002,383,872
4Feb 3, 2026 09:2665,887574,216,168544,864,0001,999,0002,519,040
5Feb 3, 2026 09:2665,895578,049,226544,929,0001,999,0002,519,040
6Feb 3, 2026 09:2665,895573,747,536545,930,000999,0002,519,040
7Feb 3, 2026 09:2665,969576,497,445546,542,000999,0002,510,848
8Feb 3, 2026 09:2665,977572,405,700545,613,0001,998,0002,510,848
9Feb 3, 2026 09:2665,979577,289,354544,628,0002,997,0002,375,680