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 listNov 5, 2025 00:00AntonAntonScore: 61,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 00:0061,901540,435,214510,780,0002,998,0002,543,616
2Nov 5, 2025 00:0061,913541,166,393511,883,0001,999,0002,453,504
3Nov 5, 2025 00:0061,918545,005,155510,923,0002,999,0002,297,856
4Nov 5, 2025 00:0061,927547,008,556511,994,0001,999,0002,306,048
5Nov 5, 2025 00:0061,942540,790,124511,122,0003,000,0002,408,448
6Nov 5, 2025 00:0061,945539,809,412513,145,0001,000,0002,424,832
7Nov 5, 2025 00:0061,950545,022,141512,186,0002,000,0002,428,928
8Nov 5, 2025 00:0061,951537,225,103514,192,00002,293,760
9Nov 5, 2025 00:0061,957543,369,797512,247,0002,000,0002,306,048