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 18, 2026 10:12wnwnScore: 7,217Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:126,25277,027,27248,898,0002,993,0002,400,256
2Feb 18, 2026 10:126,32885,407,24948,485,0004,040,0002,465,792
3Feb 18, 2026 10:126,37874,433,09049,938,0002,996,0002,359,296
4Feb 18, 2026 10:127,21788,186,21655,904,0003,993,0002,523,136
5Feb 18, 2026 10:127,27277,834,86757,340,0003,017,0002,457,600
6Feb 18, 2026 10:127,58290,261,00160,933,0001,997,0002,277,376