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 7, 2026 18:43Genos0Genos0Score: 73,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 18:4373,463619,594,038608,569,0001,176,0002,113,536
2Aug 7, 2026 18:4373,491619,868,552608,746,0001,234,0002,113,536
3Aug 7, 2026 18:4373,618622,164,810609,771,0001,263,0002,113,536
4Aug 7, 2026 18:4373,930623,509,092612,448,0001,175,0002,113,536
5Aug 7, 2026 18:4373,962623,682,913612,715,0001,177,0002,113,536
6Aug 7, 2026 18:4373,972623,869,212612,843,0001,126,0002,113,536
7Aug 7, 2026 18:4373,975623,902,127612,829,0001,168,0002,113,536
8Aug 7, 2026 18:4373,975623,826,598612,883,0001,113,0002,113,536
9Aug 7, 2026 18:4374,006624,073,009613,130,0001,124,0002,113,536