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 listApr 13, 2026 06:26wnwnScore: 4,248Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 06:264,16662,108,43033,562,0001,017,0002,494,464
2Apr 13, 2026 06:264,16965,605,61033,585,0001,017,0002,277,376
3Apr 13, 2026 06:264,19857,542,99133,846,000995,0002,498,560
4Apr 13, 2026 06:264,20957,584,51532,940,0001,996,0002,277,376
5Apr 13, 2026 06:264,24856,343,10333,246,0002,014,0002,277,376
6Apr 13, 2026 06:264,27264,630,76334,443,0001,013,0002,277,376
7Apr 13, 2026 06:264,29864,271,41034,657,0001,019,0002,490,368
8Apr 13, 2026 06:264,30162,205,85434,682,0001,020,0002,277,376
9Apr 13, 2026 06:264,31661,434,91833,836,0001,990,0002,535,424