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 listDec 6, 2025 11:45Rajarshi BasuRajarshi BasuScore: 6,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 11:456,48281,795,24152,804,000996,0002,289,664
2Dec 6, 2025 11:456,48882,455,34451,858,0001,994,0002,277,376
3Dec 6, 2025 11:456,48978,975,88651,865,0001,994,0002,289,664
4Dec 6, 2025 11:456,48982,398,02652,860,000997,0002,289,664
5Dec 6, 2025 11:456,49279,326,40951,889,0001,995,0002,289,664
6Dec 6, 2025 11:456,53080,195,74952,196,0002,007,0002,277,376
7Dec 6, 2025 11:456,60583,535,02652,831,0001,993,0002,289,664
8Dec 6, 2025 11:456,61782,520,63453,926,000998,0002,277,376
9Dec 6, 2025 11:456,61987,043,04652,943,0001,997,0002,289,664
10Dec 6, 2025 11:456,63686,375,73852,077,0003,004,0002,273,280
11Dec 6, 2025 11:456,64383,140,66852,128,0003,007,0002,289,664
12Dec 6, 2025 11:456,76786,293,48354,160,0002,005,0002,281,472