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 listAug 21, 2025 20:50Adam FolwarcznyAdam FolwarcznyScore: 17,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 20:5017,477165,697,686143,058,0002,000,0002,531,328
2Aug 21, 2025 20:5017,490167,373,274143,165,0002,002,0002,441,216
3Aug 21, 2025 20:5017,490166,385,600144,168,0001,001,0002,441,216
4Aug 21, 2025 20:5017,490166,114,932143,168,0002,002,0002,441,216
5Aug 21, 2025 20:5017,493165,918,026143,187,0002,002,0002,269,184
6Aug 21, 2025 20:5017,495171,862,630144,207,0001,001,0002,281,472
7Aug 21, 2025 20:5017,495169,515,670144,209,0001,001,0002,441,216
8Aug 21, 2025 20:5017,497164,015,368144,226,0001,001,0002,531,328
9Aug 21, 2025 20:5017,528168,948,552144,483,0001,003,0002,531,328