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 9, 2025 00:08izotoffizotoffScore: 60,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 9, 2025 00:0660,576532,136,166500,783,0001,999,0002,510,848
2Nov 8, 2025 23:4460,586526,375,925500,868,0001,999,0002,543,616
3Nov 9, 2025 00:0860,586527,153,800501,864,000999,0002,519,040
4Nov 8, 2025 23:4460,588532,446,444501,878,000999,0002,543,616
5Nov 9, 2025 00:0660,593535,563,888501,920,000999,0002,519,040
6Nov 8, 2025 23:4460,597533,105,701501,957,000999,0002,543,616
7Nov 9, 2025 00:0860,602524,934,641500,994,0001,999,0002,539,520
8Nov 9, 2025 00:0860,604527,162,443501,010,0002,000,0002,281,472
9Nov 9, 2025 00:0660,635523,001,591500,271,0003,001,0002,539,520